Method and system for generating multi-dimensional motion profiles

ABSTRACT

A system comprises control logic and a programming interface. The programming interface is configured to permit a user to specify a plurality of weighting points in a multi-dimensional coordinate space. The control logic includes spline computation logic configured to generate a spline curve based on boundary conditions. The spline curve extends near the weighting points. The control logic is configured to generate control signals to control operation of a plurality of motion axes to drive movement of a controlled element along a path defined by the spline curve.

BACKGROUND OF THE INVENTION

1. Field

This invention relates to a method and system apparatus for generating multi-dimensional motion profiles. In a particularly preferred embodiment, the invention relates to a method and apparatus for generating multi-dimensional motion profiles in a motion control system, such as in an industrial control system.

2. Description of Related Art

Motion control systems are known for controlling motors. Motors may be electric, hydraulic, or any other type of physical motor. For example, motion control systems have been used in industrial control systems for manufacturing, processing, packaging, testing, automation, measurement, robotic, material handling, assembling, cutting (metal, laser and others), grinding, welding, pick and place and other applications. In such systems, motion control systems are used to control motion of a controlled element, such as a tool (drill bit or other machine tool), a robotic arm (e.g., a pick-and-place mechanism at a tip of the robotic arm), actuator, sensor, or other device. Herein, the term “controlled element” refers broadly to any device, apparatus, and structure of interest or portion thereof whose position is controlled.

In some systems, the position of a controlled element is determined by the positions of multiple motors. In such systems, it would be desirable to be able to control the motors in a coordinated fashion. Particularly, it would be desirable to be able to generate multi-dimensional motion profiles for the controlled element, and to be able to control the motors in a coordinated fashion in accordance with the multi-dimensional motion profiles. Further, it would also be desirable to be able to perform coordinate transformations between Cartesian, cylindrical, and spherical coordinate systems as well as forward and inverse kinematic transformations. An ongoing need exists for systems and methods which are able to perform these functions.

It should be understood that the teachings herein may also be used to achieve other advantages in addition to or different than the above-mentioned advantages.

SUMMARY OF THE INVENTION

According to a first preferred embodiment, a system comprises control logic and a programming interface. The programming interface is configured to permit a user to specify a plurality of weighting points in a multi-dimensional coordinate space. The control logic includes spline computation logic configured to generate a spline curve based on boundary conditions. The spline curve extends near the weighting points. The control logic is configured to generate control signals to control operation of a plurality of motion axes to drive movement of a controlled element along a path defined by the spline curve.

According to another preferred embodiment, a control method for controls movement of a controlled element in a multi-dimensional coordinate system. The method comprises receiving a plurality of weighting points by way of a user instruction, generating a plurality of control points for a plurality of adjacent spline segments based on boundary conditions and the plurality of weighting points, generating a plurality of coefficient vectors for the plurality of spline segments based on the plurality of control points, generating a first plurality of position reference values based on the plurality of coefficient vectors and using the first plurality of position reference values to control a first motion axis, and generating a second plurality of position reference values based on the plurality of coefficient vectors and using the second plurality of position reference values to control a second motion axis. The first motion axis operates in a first dimension of the multi-dimensional coordinate system and the second motion axis operates in a second dimension of the multi-dimensional coordinate system.

According to another preferred embodiment, a system comprises motion control logic configured to control a first motion axis and a second motion axis in accordance with a user program. The motion control logic provides a plurality of instructions configured for use in the user program. The plurality of instructions include an instruction that permits a move to be specified by specifying weighting points for a spline path to be followed by the controlled element in a multi-dimensional coordinate system that includes the first motion axis and the second motion axis.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1A is an overview of a control system that incorporates a reference value generation system and method according to an exemplary embodiment;

FIG. 1B is a schematic view of a motion controller, servo drive and motor of FIG. 1A shown in greater detail;

FIG. 2 is a functional block diagram showing building blocks embodied in a programming interface usable to program the control system of FIGS. 1A-1B according to an exemplary embodiment;

FIGS. 3-4 are examples of multi-dimensional path profiles that may be generated for use in connection with the control system of FIGS. 1A-1B according to an exemplary embodiment;

FIG. 5 is a functional block diagram showing a coordinated move block of FIG. 2 in greater detail;

FIG. 6 is a functional block diagram showing a coordinate transform block of FIG. 2 in greater detail;

FIG. 7 is a functional block diagram showing the coordinate transformation block of FIG. 6 in combination with the coordinated move block of FIG. 2;

FIGS. 8-14 are examples of coordinate systems that may be used in programming the control system of FIGS. 1A-1B according to an exemplary embodiment;

FIG. 15 is an example of a linear move that may be programmed for use in connection with the control system of FIGS. 1A-1B according to an exemplary embodiment;

FIG. 16 is an example of a circular move that may be programmed for use in connection with the control system of FIGS. 1A-1B according to an exemplary embodiment;

FIG. 17 is an example of a blended move that may be programmed for use in connection with the control system of FIGS. 1A-1B according to an exemplary embodiment;

FIG. 18 is an instruction faceplate for a coordinate move instruction according to an exemplary embodiment;

FIG. 19 is an instruction faceplate for a coordinate transformation instruction according to an exemplary embodiment;

FIG. 20 is an instruction faceplate for a calculate target position instruction according to an exemplary embodiment;

FIG. 21 is an instruction faceplate for a change coordinated dynamics instruction according to an exemplary embodiment;

FIG. 22 is an instruction faceplate for a stop instruction according to an exemplary embodiment;

FIG. 23 is an instruction faceplate for a linear coordinated move instruction according to an exemplary embodiment;

FIG. 24 is an instruction faceplate for a circular coordinated move instruction according to an exemplary embodiment;

FIG. 25 shows an example of a Bézier spline curve which may be generated according to another exemplary embodiment;

FIG. 26 shows a process for generating position reference values as a function of time for the embodiment of FIG. 25;

FIG. 27 shows a transition from a preceding motion profile to a Bézier spline segment for the embodiment of FIG. 25;

FIG. 28 shows another transition from a preceding motion profile to a Bézier spline segment for the embodiment of FIG. 25;

FIG. 29 shows a transition from a preceding circular motion profile to a Bézier spline segment for the embodiment of FIG. 25;

FIG. 30 shows a two-segment Bézier spline that blends from one linear motion profile to another linear motion profile for the embodiment of FIG. 25; and

FIG. 31 shows a two-segment Bézier spline that blends from a linear motion profile to a circular motion profile for the embodiment of FIG. 25.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

Various preferred embodiments of the invention will now be described. Although the invention is described by way of example in the context of an industrial control system, it will be appreciated that the invention may be employed in other types of systems as well.

I. Preferred System Architecture

A. Hardware Configuration

Referring now to FIGS. 1A-1B, FIG. 1A shows an overview of a control system 10 in which a multi-dimensional motion profile is generated in accordance with a preferred embodiment. Although the control system 10 is shown to be an industrial control system, it will be appreciated that the methods and systems described herein may also be applied in other contexts.

The control system 10 comprises a plurality of industrial controllers 12 that are interconnected by way of a communication network 14. The control system 10 also includes a plurality of input devices 16 and a plurality of output devices 17. The output devices 17 are controlled by the controllers 12 in response to input status information from the input devices 16. In one embodiment, the industrial controllers 12 are programmable logic controller (PLC) systems. Other hardware configurations may also be used.

The control system 10 operates based on execution of a user program that is tailored to the industrial control system and the particular manufacturing, processing, packaging, automation, testing, measurement, robotic and/or other application(s) for which it is used. In the illustrated embodiment, the control system 10 includes multiple industrial controllers 12, and the user program may comprise one or more subprograms that are executed by the industrial controllers 12. In a simpler industrial control system, such as in the case of a stand-alone motion control system, the user program may be contained in a single motion controller.

At least some of the controllers 12′ include an output device 17 which is a motion control system 20. The controllers 12′ include a motion controller 23 which is connected by way of a servo drive 25 to a motor 27. A feedback sensor 29, which may be integrated with the motor 27 or provided separately, is also provided for position/velocity feedback. The feedback sensor 29 may, for example, be an encoder or a resolver. The motion controller 23 may be provided as a separate physical module, as program logic included in the controller 12′, or in a variety of other configurations. Likewise, as previously noted, the motion controller 23 may also be integrated with the servo drive 25 and/or integrated with the motor 27. Other configurations are also possible.

The interconnection of the motion controller 23, the servo drive 25, the motor 27 and sensor 29 for an exemplary hardware configuration is shown in greater detail in FIG. 1B. As shown therein, the system 10 also includes a user program 30, which may be executed by the industrial controller 12′ and/or by the motion controller 23. The user program 30 includes one or more multi-axis coordination instructions 31, described in greater below, as well as other instructions 32.

In combination, the motion controller 23 and the servo drive 25 implement a position control loop 34, a velocity control loop 38, and a torque or current control loop 42. The position control loop 34, which is shown to include a PI (proportional-integral) gain element 36, operates to minimize the difference between a commanded position of the rotor shaft (provided by the user program) and the actual position of the rotor shaft (provided by the sensor 29). The velocity control loop 38, which is nested within the position control loop and is shown to include a PI gain element 40, operates to minimize the difference between a commanded rotor shaft velocity (provided by the position control loop 34) and the actual velocity of the rotor shaft (determined based on feedback information provided by the sensor 29). The torque/current control loop 42 is nested within the velocity control loop 38. (Because torque/current magnitudes are proportional, the same control loop can be viewed as either a torque control loop or a current control loop.) The torque/current control loop 42, which is shown to include a PI gain element 44, operates to minimize the difference between a commanded torque/current (received from the velocity control loop) and the actual torque/current (measured using current sensors, not shown). In combination, therefore, the control loops 34, 36 and 38 are capable of accepting a position command and in response generating current to drive the motor and thereby to control the motor to obtain the commanded position. The location of the position, velocity and current loops is not important. Additionally, other loop configurations are also possible, which may contain any combination of feed forward loops, open loops, closed loops, or nested loops etc.

In operation, to move from one position to another, a series of intermediate position reference values are generated for or by the motion controller 23. Thus, if the motor is to move to a new position X_(end), then a series of incremental position reference values X_(ref(1)) . . . X_(ref(n)) are generated that extend from an initial position X₀ to the new position X_(end). The incremental position reference values are generated by logic commonly referred to as an “interpolator.” An example of an interpolator is disclosed in U.S. Pat. No. 6,300,738, entitled “Method and Apparatus for Generating Reference Values for a Motion Control Loop in an Industrial Control System,” hereby incorporated by reference. In practice, the position reference values may be provided in the form of delta position information (change in position since the last update) rather than absolute position information. The position reference values may be updated each millisecond, for example.

The incremental position reference values are provided as position commands to the position feedback control loop 34 with a new position reference value being provided every few milliseconds or so. In this way, as new position references are generated, the motor “chases after” or follows the position references until the position X_(end) is reached.

Typically, the interpolator generates the incremental position reference values responsive to encountering an instruction in a user program in which the motor 27 is instructed to move from a current position to a new position, with the new position being specified as a parameter of the instruction. Such an instruction may be a single dimensional instruction, in which the move instruction commands only a single motor to move to a new position. Herein, such an instruction is referred to simply as a “move” instruction.

In the system 10, multi-axis coordination instructions 31 are preferably also provided. For example, as described in greater detail below, a coordinated move instruction 200 (FIG. 18) is preferably also provided that allows an operator to program multi-dimensional moves and allows the motion of multiple motors to be coordinated responsive to the user-programmed multi-dimensional move/path profile. This permits a single instruction to be used to program movement of a controlled element to move from a current position to a new position, wherein the movement to the new position involves the action of more than one motor 27. Likewise, a coordinate transformation instruction 300 (FIG. 19) allows a user to specify a move in one coordinate system and have the move implemented in another coordinate system. The multi-axis coordination instructions 31 are described in greater detail below.

B. Programming Interface

A variety of different programming interfaces may be used to control the control system 10 of FIGS. 1A-1B. Such programming interfaces may be based on standard sequential programming languages programming languages (e.g., C, C++, Visual Basic, etc), programming languages used for industrial controls (e.g. ladder diagram, structured text, function block, sequential function chart, flow charts, GML etc) or motion control programming (e.g., computer numeric control or CNC-type languages, such as RS274D), other sequential programming languages, and so on.

In the preferred embodiment, an arrangement such as that shown in FIG. 2 is employed. Referring now to FIG. 2, FIG. 2 is a functional block diagram showing building blocks embodied in a programming interface usable to program the control system 10. The building blocks include one or more motion control axis blocks 52, one or more output cam blocks 54, one or more output blocks 56, and a plurality of motion control blocks 58. The motion control blocks 58 further include one or more jog blocks 62, one or more move blocks 64, one or more time cam blocks 66, one or more gear blocks 68, one or more position cam blocks 70, one or more coordinated move blocks 72, and one or more coordinate transformation blocks 74. The motion control blocks 58 also include an adder block 75, which combines inputs (e.g., incremental position command values) from the remaining motion control blocks 58.

In one embodiment, the building blocks 52-58 are implemented as objects in an object-oriented programming environment. In an object-oriented programming environment, individual objects typically represent different physical objects (e.g., motors, sensors, etc.), relationships between physical objects (e.g., camming relationships, gearing relationships, etc), and so on. The objects are then accessed by instructions in a user program to affect operation of the physical objects or relationships therebetween. Thus, the axis blocks 52 may each be implemented as an object having services that may be invoked using one or more axis instructions, and the output cam blocks 54 may be implemented as an object having services that may be invoked using one or more output cam instructions. Further, each of the motion control blocks 58 may be implemented as objects (e.g., a jog object, a move object, a time cam object, a gear object, a position cam object, a coordinated move object, and a coordinate transformation object) having services that may be invoked using one or more respective instructions (e.g., a jog instruction, a move instruction, a time cam instruction, a gear instruction, a position cam instruction, a coordinated move instruction, and a coordinate transformation instruction).

In designing such a system, new instances of the above-mentioned objects may be created to represent new/additional devices or relationships between devices. Thus, although only a small number of building blocks 52-58 is shown, it will be appreciated that this configuration is purely for purposes of explanation and that practical systems are likely to have a configuration different than that shown in FIG. 2, typically with many additional ones of the building blocks 52-58. For example, new instances of the axis object may be created to represent each additional motion control axis (e.g., a motor, a shaft or other device driven by a motor, virtual axis, and so on), and various axis instructions may be incorporated into a user program to invoke the services of the axis objects. The axis instructions may then be executed to control movement of the motion control axes (e.g., to control a position such as an absolute position, relative position, delta position, etc., of the motion control axis). Other instructions may be executed to control output devices using the services of the output objects 56, for example, as a function of motor position (actual or measured) using output cam objects 54. Typically, the operation of the output devices 50 will at least to some extent be cyclic, and the output cam objects 54 may be used to synchronize the operation of the output devices to rotation of the shaft of a motor 27 (or to movement of a device driven by the shaft of the motor 27).

The motion control blocks 58 allow the motion control axis to be controlled in different ways. The jog block 62 permits the user (via a jog instruction) to specify a new velocity at which the shaft of the motor 27 is to move. The move block 64 permits the user (via a move instruction) to specify a new position for the shaft of the motor 27. The time cam block 66 permits the user (via a time cam instruction) to specify an axis position profile which specifies axis position as a function of time. The gear cam block 68 permits the user (via a gear instruction) to specify an electronic gearing relationship between the shaft of the motor 27 and the shaft of another motor (not shown) in the system 10. The position cam block 70 permits the user (via a position cam instruction) to specify an axis position profile which specifies axis position for the shaft of the motor 27 as a function of a position of the shaft of another motor (not shown) in the system 10. In the case of the gear block 64 and the position cam block 70, it will be appreciated that these blocks will receive inputs from other axis blocks similar to the axis block 52, which may in turn receive inputs from motion blocks similar to the motion blocks 58. The coordinate move block 72 and the coordinate transformation block 74 are described in greater detail below. It is therefore seen that the complexity of the motion control system 10 can be increased by providing multiple axes (and therefore multiple motors or other devices) and defining various relationships between the axes and other devices. Fewer, more, or different building blocks and instructions may also be used. Of course, it should be understood that these features, and all of the other features described herein, may also be implemented without using object-oriented techniques.

Referring back to FIGS. 1A-1B, each of the motors 27 is represented by an axis block 52 that is stored as control logic in the industrial controllers 12′ (or motion controllers 23). It may also be noted, however, that virtual axes may also be used. Accordingly, in some cases, axis blocks 52 may be used in situations where there is no associated physical motor.

The control logic associated with each of the axis blocks 52 generates control signals for a respective one of the motors 27 responsive to inputs from the adder block 75. For example, in the preferred embodiment, described in greater detail below, the coordinated move block generates incremental position reference commands for each motion control axis block 52. Each axis block 52 uses the position reference commands as input to the nested feedback control arrangement described above in connection with FIG. 1B. The position of the motor 27 is monitored by the feedback device 29 which provides feedback information to the axis block 52. Alternatively, the feedback device 29 may be used to monitor the position of a device driven by the motor 27.

II. Coordinated Move and Coordinate Transformation Blocks

The coordinated move block 72 and the coordinate transformation block 74 will now be described in greater detail. The coordinated move block 72 provides a programmer of the system 10 with user-friendly mechanisms for controlling motion of multiple motion control axes (e.g., multiple motors 27) in a coordinated fashion. The coordinate transformation block 74 provides the programmer with a mechanism for relating the axes of one coordinate system to the axes of another coordinate system. Although two axes are shown, it will be understood that the blocks 72 and 74 may be used in connection with three axes or any other number of axes. If an object oriented approach is used, interfaces to the coordinated move block 72 and the coordinate transformation block 74 may be provided by way of one or more multi-axis coordination instructions 31, described in greater detail in Section III, below.

The coordinated move block 72 preferably provides an interface for linear moves in multi-dimensional Cartesian space and circular moves in two and three-dimensional Cartesian space. The preferred algorithm used for the path planning permits dynamic parameter changes for maximum velocity, acceleration, and deceleration along the path. It also provides smooth transitions (without spikes in acceleration) from one coordinated move path segment to the next.

The coordinate transformation block 74 preferably provides an interface for relating the axes of a source coordinate system to the axes of the target coordinate system. The possible source and target systems may include Cartesian coordinate systems in multi-dimensional space, cylindrical and spherical coordinate systems in two- and three-dimensional space, and independent and dependent kinematic coordinate systems in two- and three-dimensional space. The coordinate transformation block 74 enables translation and rotation from the source to the target system.

Referring now to FIGS. 3-4, examples of the operation of the coordinated move block 72 are shown. FIGS. 3-4 both show path profiles followed by a controlled element that is controlled by the coordinated move block 72. In FIG. 3, an exemplary two-dimensional path profile is shown which may be executed, for example, in the context of a pick-and-place system. Thus, as shown in FIG. 3, a pick-up mechanism may pick up a part at point A, move up along path segment 82, move over along path segment 84, and move down along path segment 86 to a placement point B. The path segments 82, 84 and 86 are not tangential to each other. Accordingly, transitioning path segments 88 and 90 are also shown which extend between and connect the path segments 82, 84 and 86. The transitioning path segments 88 and 90 transition movement from trajectories along the path segments 82 and 84 to trajectories along the path segment 84 and 86, respectively. In the context of the pick-and-place example, the transitioning path segments 88 and 90 allow the pick-and-place mechanism to smoothly transition between the path segments 82, 84 and 86 while maintaining a smooth acceleration profile and while not having to slow down. The path segments 88 and 90 may have shapes which are optimized for smooth path transitions and need not be circular segments.

Preferably, for programming convenience, the programming interface permits the programmer to specify only the path segments 82, 84 and 86 and the programmer is not required to also specify the transitioning path segments 88 and 90. It may be the case that the programmer is not particularly concerned about the exact manner in which the transitioning path segments are executed, and therefore this arrangement permits the programmer to program the overall path profile by programming only three path segments instead of five, which is more convenient.

The path segments 82, 84 and 86 may be specified as parameters in user instructions of a user program. For example, a separate coordinated move instruction may be used to program each of the segments 82, 84 and 86. In FIG. 3, the path segments 82, 84 and 86 are shown to be linear path segments. For each linear path segment, the coordinated move instruction may be used to specify endpoints 92 of the path segment and/or transition points or other parameters indicating when the move may begin transitioning from one linear path segment to the next. The additional transitioning path segments 88 and 90 are generated automatically by the coordinated move block 72 and do not need to be specified by the user. Of course, although the path profile shown in FIG. 3 comprises a series of user-specified non-tangential path segments 82, 84 and 86 connected by transitioning path segments 88 and 90, the user is also permitted specify path segments that are tangential (such that there is no need for transitioning path segments) for other portions of the overall path.

In operation, movement of the controlled element is first driven along the segment 82 responsive to a first coordinated move instruction in a user program. When the transition point 92 is reached, the coordinated move block 72 operates to control movement of the controlled element along the transition path segment 88. This process continues until the placement point B at the end of path segment 86 is reached. Typically, the transition from one path segment to the next uses the end dynamics of the current path segment as the start dynamics for the next path segment.

In FIG. 4, two path segments 94 and 96 specified by a user and an additional transitioning path segment 98 are shown. As shown in FIG. 4, the path segment 94 is generally linear and the path segment 96 is generally circular. In one embodiment (FIG. 18), the same coordinated move instruction may be used by an operator to program both types of moves. In another embodiment (FIGS. 23-24), one instruction may be used to program linear moves and another instruction may be used to program circular moves.

As shown in FIG. 4, the path segment 94 and the path segment 96 are located in different three-dimensional planes. The path segment 94 is generally normal to the plane defined by the path segment 96 and, accordingly, there is no single three dimensional plane that contains both path segments 94 and 96. Nevertheless, the coordinated move block 72 is able to generate the transitioning path segment 98 which is able to transition between the non-tangential, non-coplanar path segments. The transitioning path segment need not be specified by a user, which makes it easier for the user to program the system 10.

As will be seen below, in the coordinated move instruction 200, the user specifies a group of coordinated motion control axes (e.g., corresponding to the motors 27) which define the target coordinate system for the move. Generally speaking, the target coordinate systems may be different from one path segment to the next. With reference to FIG. 5, each coordinated move is preferably transformed into multiple individual orthogonal moves (represented as move blocks 76) of a source coordinate system during initial execution of a coordinated move instruction 200. In the context of the coordinated move block 72, the source coordinate system is defined by the coordinated move block 72 and is not user-specified. As detailed below, in one embodiment, the source coordinate system is defined based on the trajectory of the path segment. For example, the source coordinate system may be defined as having one axis which is tangential to the path segment, along with additional axes which are normal and bi-normal to the tangential axis.

In one embodiment, for the transitioning path segments, the source coordinate system is defined relative to the next path segment (e.g., when transitioning from path segment 82 to path segment 84, a source coordinate system defined based on the path segment 84 may be used). As noted previously, however, the transition from one path segment to the next preferably uses the end dynamics of the current path segment as the start dynamics for the next path segment. Accordingly, in a more preferred embodiment, as the move transitions dynamically from the source coordinate system that was used in connection with path segment 82 to the source coordinate system to be used in connection with path segment 84, the move's dynamics (position, velocity and acceleration) change gradually from one path segment to the next path segment. This arrangement facilitates providing a smooth acceleration profile as the transition from one path segment to the next path segment occurs. The interpolators are reinitialized with each path segment and the orientation of the interpolators remains constant during the execution of each path segment.

Because each coordinated move is transformed into multiple individual orthogonal moves, a separate interpolator may be provided for each orthogonal move (that is, each move block 76 may be provided with its own separate interpolator). Each interpolator provides a separate respective set of incremental position reference values for each of the axes of the source coordinate system during a dynamic phase of the move instruction. Assuming for example a three dimensional source coordinate system, three interpolators may be used which each generate a set of incremental position reference values in the source coordinate system. The incremental position reference values are generated substantially simultaneously by the interpolators, e.g., in accordance with regular update cycles (which may for example be in the range of hundreds of milliseconds to microseconds).

The coordinated move block 72 includes coordinate transformation logic which performs a coordinate transformation to transform the incremental position reference values commands from the source coordinate system to a target coordinate system. Whereas the source coordinate system is preferably defined based on the trajectory of the move, the target coordinate system is preferably defined based on the motion control axes which correspond to the axes of movement of three respective motors, as previously noted. The coordinate transformation logic is therefore able to transform the incremental position reference values generated by the move blocks 76 in the source coordinate system to position reference values which are useable by the motion controllers 23 in the target coordinate system.

With reference to FIG. 2, the move blocks 76 are connected to the coordinated move block 72. As a result, the outputs of the individual move objects 76 provide the inputs (incremental position reference values) to the coordinated move block 72, and the coordinated move block 72 is responsible for transforming the individual moves back into the target coordinate system and supplying these coordinates to the axis blocks 52. After completion of the individual moves, the target coordinates are preferably adjusted to the target position values, to accommodate any rounding errors in the transformation. This routine may be executed in the coordinated move block 72.

With reference to FIG. 6, the coordinate transformation block 74 preferably provides an interface for relating the axes of a source coordinate system to the axes of the target coordinate system. As shown in FIG. 6, the axes of a source system are connected to the coordinate transformation block 74. The coordinate transformation block 74 is used to transform the incremental position reference values in the source coordinate system from the axis blocks 78 into incremental position reference values in the target coordinate system for the axis blocks 80.

With reference to FIG. 7, the coordinated move block 72 and coordinate transformation block 74 may also be used in combination. For example, in the case of a two-axis robot, it may be desirable to control the shoulder and elbow axis of the robot by commanding a path in Cartesian space. In this configuration, the coordinated move block 72 may provide the command position for the x- and y-axis. The coordinate transformation block 74 may then be responsible for transforming the x- and y-axis positions into the shoulder and elbow axis positions.

The source axis may provide either the actual or command coordinates as input for the coordinate transformation block 74. This allows multi-dimensional interpolation to operate in one domain (e.g., an x-y coordinate system) even though the hardware (e.g., motors, feedback devices) are operating in another domain (e.g., a shoulder-axis, elbow-axis coordinate system).

In FIGS. 5-7, the coordinated move block 72 and the coordinate transformation block 74 are shown as being connected to multiple axis blocks 78. Each axis block 78 is associated with a different corresponding motor. However, this relationship may be direct or indirect. For example, each of the axis blocks 78 may directly correspond to an associated motor. Alternatively, one or more of the axis blocks 78 may be a virtual axis which is connected by way of one or more other blocks (not shown) to an associated motor.

As apparent from the above discussion, in the preferred embodiment, the coordinated move path is calculated using multi-dimensional interpolation with coordinate transformation. This approach may offer such advantages as support for dynamic path transitions, smooth path transitions, independent specification of acceleration and deceleration, and relatively easy implementation. Other approaches, such as one-dimensional interpolation with coordinate transformation, superimposed interpolation of two profiles with coordinate transformation, interpolation with finite impulse response filters, interpolation with non-uniform rational B-splines, and interpolation with Bezier splines may be used. In some cases, these other approaches offer faster speed for short move distances. As will be appreciated, each of these other approaches offers their own advantages and disadvantages.

The coordinated move block 72 and the coordinate transformation block 74 preferably support a variety of coordinate systems. Section II(A) describes examples of coordinate systems that may be supported and associated coordinate transformation equations. Section II(B) describes examples of supported coordinated moves. Section II(C) describes examples of auxiliary algorithms that may be used to derive the transformation matrices. Section II(D) describes examples of instruction interfaces for coordinated moves and the relationship to the coordinated move block 72 and the coordinate transformation block 74. The equations and algorithms in Sections II(A)-II(C) may be embodied in and employed by the coordinated move block 72 and the coordinate transformation block 74 in connection with providing services invoked by the instructions described in Section II(D). While Sections II(A)-II(D) provide examples of mathematical equations, algorithms, instruction interfaces, and techniques that may be used to implement the functionality described herein, it will be appreciated that other equations, algorithms, interfaces and techniques may also be used.

A. Coordinate System Description

The coordinated move block 72 and the coordinate transformation block 74 preferably supports a variety of different coordinate systems. These coordinate systems may include, for example, multi-dimensional Cartesian coordinate systems, two- and three-dimensional cylindrical, and spherical coordinate systems as well as two and three-dimensional independent and dependent coordinate systems. The two-dimensional cylindrical and spherical coordinate system can also be viewed as polar coordinate system. The independent and dependent coordinate systems represent specific kinematic relationships. Of course, depending on the application, additional and/or different coordinate systems may also be used.

For purposes of mathematical characterization, each coordinate system is specified by a coordinate origin, a coordinate basis, and a scale of measurement along the basis axes or curves. With these specifications, a point in space is defined by a set of coordinates that specify the multitude of the scale of measurement along each basis axes or curve.

In addition to defining a point in space with one coordinate system, it also is desirable to be able to transform the coordinates of a point from one coordinate system to another. Coordinate transformation is also desirable for the implementation of the coordinated moves. The principal coordinate transformations are translation (shifting) and rotation of a Cartesian coordinate system and transforming cylindrical, spherical, independent, and dependent coordinate systems to and from a Cartesian coordinate system. All other transformations can be derived from these principal coordinate transformations. The coordinate transformations described in this section are used in both the coordinated move block 72 and the coordinate transformation block 74.

This section describes these various coordinate systems. The following table provides a description of vector math notations used herein: TABLE I Exemplary Mathematical Notations NOTATION DESCRIPTION x Scalar value P = (x₁, . . ., x_(n)) Point or Position (text format) $P = \begin{bmatrix} x_{1} \\ \vdots \\ x_{n} \end{bmatrix}$ Point or Position (equation format) {overscore (v)} = [v₁, . . ., v_(n)] Vector (text format) $\overset{\_}{v} = \begin{bmatrix} v_{1} \\ \vdots \\ v_{n} \end{bmatrix}$ Vector (equation format) {overscore (v)}^(T) = [v₁. . . v_(n)] Transposed vector (equation format) {overscore (M)} = [{overscore (v)}₁, . . . , {overscore (v)}_(n)] Matrix (text format) $\begin{matrix} {\overset{\_}{M} = \begin{bmatrix} {\overset{\_}{v}}_{1} & \cdots & {\overset{\_}{v}}_{n} \end{bmatrix}} \\ {= \begin{bmatrix} v_{11} & \cdots & v_{n1} \\ \vdots & \ddots & \vdots \\ v_{1m} & \cdots & v_{nm} \end{bmatrix}} \end{matrix}\quad$ Matrix (equation format) ${\begin{matrix} {{\overset{\_}{M}}^{T} = \begin{bmatrix} {\overset{\_}{v}}_{\overset{\_}{1}}^{T} \\ \vdots \\ {\overset{\_}{v}}_{n}^{T} \end{bmatrix}} \\ {= \begin{bmatrix} v_{11} & \cdots & v_{1m} \\ \vdots & \ddots & \vdots \\ v_{n1} & \cdots & v_{nm} \end{bmatrix}} \end{matrix}\quad}\quad$ Transposed matrix (equation format) B = {{overscore (v)}₁, . . ., {overscore (v)}_(n)} Basis of a coordinate system atan (x₂, x₁) Angle between the vector from the origin O to the point P (x₁, x₂) and the positive {overscore (x)}₁-axis with the angle limited to the range (−π, π). {overscore (v)}^(T){overscore (w)} = v₁w₁ + . . . + v_(n)w_(n) Inner product of two vectors ${\overset{\_}{v} \times \overset{\_}{w}} = \begin{bmatrix} {{v_{2}w_{3}} - {v_{3}w_{2}}} \\ {{v_{3}w_{1}} - {v_{1}w_{3}}} \\ {{v_{1}w_{2}} - {v_{2}w_{1}}} \end{bmatrix}$ Outer product of two vectors ${\overset{\_}{v}} = \sqrt{{\overset{\_}{v}}^{T}\overset{\_}{v}}$ Length or norm of vector {overscore (v)} det{overscore (M)} Determinant of matrix {overscore (M)} μ_(ij) = (−1)^(i+j) det {overscore (M)}_(ij) Coactor corresponding to element m_(ij) of matrix {overscore (M)}. The determinant det {overscore (M)}_(ij) is called the ijth minor of the matrix {overscore (M)}, where {overscore (M)}_(ij) is the matrix obtained by deleting the ith column and jth row of the matrix {overscore (M)}.

Herein, the term “axis” refers to a reference line of a coordinate system. The term “motion axis” refers to a linear or rotary axis having a linear or angular coordinate. A motion axis may be physical hardware (e.g., a motor) or virtual (e.g., used for data processing purposes). The term “unit vector refers to a vector whose norm is one. The term “orthogonal vectors” refers to vectors whose inner product is zero. The term “orthonormal vectors” refers to orthogonal unit vectors. The term “orthogonal matrix” refers to a matrix whose column vectors are mutually orthonormal.

1. Cartesian Coordinate System

Referring now to FIG. 8, FIG. 8 shows the geometric relationship of a three-dimensional Cartesian coordinate system 100. As shown in FIG. 8, the Cartesian coordinate system 100 is defined by a coordinate origin O and mutually orthogonal coordinate axes {{overscore (x)}₁, . . . , {overscore (x)}_(n)). With the same linear scale of measurement on the individual axes, the Cartesian coordinates (x₁, . . . , x_(n)) define a point P in Cartesian coordinate space.

Referring now to FIG. 9, a translation transformation may be used to shift the origin of a Cartesian coordinate system. FIG. 9 illustrates the geometric relationship between the source and target coordinate systems of the translation transformation. The coordinates (x_(1,t), . . . , x_(n,t)) of a point P_(t) specified in the target system depend on the coordinates (x_(1,s), . . . , x_(n,s)) of the same point P_(s) specified in the source system and the offset vector {overscore (o)}=(x_(1,o), . . . , X_(n,o)).

The algebraic relationship between the coordinates (x_(1,s), . . . , x_(n,s)) of a point P_(s) specified in the source system and the coordinates (x_(1,t), . . . , x_(n,t)) of the same point P_(t) specified in the target system is defined by the following equation: $\begin{matrix} {P_{t} = {P_{s} + \overset{\_}{o}}} \\ {\begin{bmatrix} x_{1,t} \\ \vdots \\ x_{n,t} \end{bmatrix} = {\begin{bmatrix} x_{1,s} \\ \vdots \\ x_{n,s} \end{bmatrix} + \begin{bmatrix} x_{1,o} \\ \vdots \\ x_{n,o} \end{bmatrix}}} \end{matrix}$ The inverse transformation is defined by the following equation: $\begin{matrix} {P_{s} = {P_{t} - \overset{\_}{o}}} \\ {\begin{bmatrix} x_{1,s} \\ \vdots \\ x_{n,s} \end{bmatrix} = {\begin{bmatrix} x_{1,t} \\ \vdots \\ x_{n,t} \end{bmatrix} - \begin{bmatrix} x_{1,o} \\ \vdots \\ x_{n,o} \end{bmatrix}}} \end{matrix}$

Referring now to FIG. 10, a rotation transformation may be used to rotate the axes of a Cartesian coordinate system. FIG. 10 illustrates the geometric relationship between the source and target coordinate systems in a rotation transformation. The coordinates (x_(1,t), . . . , x_(n,t)) of a point P_(t) specified in the target system depend on the coordinates (x_(1,s), . . . , x_(n,s)) of the same point P_(s) specified in the source system and the rotation matrix {overscore (R)}=[{overscore (r)}₁, . . . , {overscore (r)}_(n)]. The columns of the rotation matrix are the basis vectors {{overscore (r)}₁, . . . , {overscore (r)}_(n)} of the source system specified in the target system. Since these vectors do not necessarily represent a mutually orthonormal basis, they are transformed into such a basis {{overscore (t)}₁, . . . , {overscore (t)}_(n)} by applying the auxiliary algorithm of Section II(C).

The algebraic relationship between the coordinates (x_(1,s), . . . , x_(n,s)) of a point P_(s) specified in the source system and the coordinates (x_(1,t), . . . , x_(n,t)) of the same point P_(t) specified in the target system is defined by the following equation. $\begin{matrix} {P_{t} = {\overset{\_}{T}P_{s}}} \\ {\begin{bmatrix} x_{1,t} \\ \vdots \\ x_{n,t} \end{bmatrix} = {\begin{bmatrix} {\overset{\_}{t}}_{1} & \cdots & {\overset{\_}{t}}_{n} \end{bmatrix}\begin{bmatrix} x_{1,s} \\ \vdots \\ x_{n,s} \end{bmatrix}}} \end{matrix}$ Since the transformation matrix {overscore (T)} is orthogonal, the above equation can be restated. $\begin{matrix} {P_{t} = {\overset{\_}{T}P_{s}}} \\ {{{\overset{\_}{T}}^{T}P_{t}} = {{\overset{\_}{T}}^{T}\overset{\_}{T}P_{s}}} \\ {= {{\begin{bmatrix} {\overset{\_}{t}}_{1}^{T} \\ \vdots \\ {\overset{\_}{t}}_{n}^{T} \end{bmatrix}\begin{bmatrix} {\overset{\_}{t}}_{1} & \cdots & {\overset{\_}{t}}_{n} \end{bmatrix}}P_{s}}} \\ {= {\begin{bmatrix} {{\overset{\_}{t}}_{1}^{T}{\overset{\_}{t}}_{1}} & \cdots & {{\overset{\_}{t}}_{1}^{T}{\overset{\_}{t}}_{n}} \\ \vdots & ⋰ & \vdots \\ {{\overset{\_}{t}}_{n}^{T}{\overset{\_}{t}}_{1}} & \cdots & {{\overset{\_}{t}}_{n}^{T}{\overset{\_}{t}}_{n}} \end{bmatrix}P_{s}}} \\ {= {\overset{\_}{I}P_{s}}} \\ {= P_{s}} \end{matrix}$ Therefore, the inverse transformation is defined by the following equation. $\begin{matrix} {P_{s} = {{\overset{\_}{T}}^{T}P^{t}}} \\ {\begin{bmatrix} x_{1,s} \\ \vdots \\ x_{n,s} \end{bmatrix} = {\begin{bmatrix} {\overset{\_}{t}}_{1}^{T} \\ \vdots \\ {\overset{\_}{t}}_{n}^{T} \end{bmatrix}\begin{bmatrix} x_{1,t} \\ \vdots \\ x_{n,t} \end{bmatrix}}} \end{matrix}$ Similarly, the algebraic relationship between a vector {overscore (v)}_(s) at the point P_(s) specified in the source system and the same vector {overscore (v)}_(t) specified in the target system is defined by {overscore (v)}_(t)={overscore (Tv_(s))} and {overscore (v)}_(s)={overscore (T)}^(T){overscore (v)}_(t).

2. Cylindrical Coordinate System

Referring now to FIG. 11, FIG. 11 shows the geometric relationship of a three-dimensional cylindrical coordinate system 110. The coordinate system 110 is defined by a coordinate origin O and three mutually orthogonal coordinate curves {r, φ, z} (tangents are orthogonal except along the {overscore (x)}₃-axis). With the same linear scale of measurement on the curves {overscore (r)} and {overscore (z)} and a radian scale of measurement on the curve {overscore (φ)}, the cylindrical coordinates (r, φ, z) define a point P in cylindrical coordinate space.

A transformation may be performed to transform coordinates in the cylindrical coordinate system to coordinates in a Cartesian coordinate system. Specifically, the algebraic relationship between the coordinates (r, φ, z) of a point P_(s) specified in the cylindrical system and the coordinates (x₁, x₂, x₃) of the same point P_(t) specified in the Cartesian system is defined by the following equation. $\begin{matrix} {P_{t} = {f_{{{Cyl}.}\rightarrow{{Cart}.}}\left( P_{s} \right)}} \\ {\begin{bmatrix} x_{1} \\ x_{2} \\ x_{3} \end{bmatrix} = \begin{bmatrix} {r\quad\cos\quad\varphi} \\ {r\quad\sin\quad\varphi} \\ z \end{bmatrix}} \end{matrix}$ Similarly, the algebraic relationship between the coordinates (v_(r), v_(φ), v_(z)) of a vector {overscore (v)}_(s) specified in the cylindrical system and the coordinates (v₁, v₂, v₃) of the same vector {overscore (v)}_(t) specified in the Cartesian system at the point P_(s) is defined by the following equation. $\begin{matrix} {\overset{\_}{v_{t}} = {g_{{{Cyl}.}\rightarrow{{Cart}.}}\left( {P_{s},\overset{\_}{v_{s}}} \right)}} \\ {\begin{bmatrix} v_{1} \\ v_{2} \\ v_{3} \end{bmatrix} = \begin{bmatrix} {{v_{r}\quad\cos\quad\varphi} - {v_{\varphi}\sin\quad\varphi}} \\ {{v_{r}\quad\sin\quad\varphi} + {v_{\varphi}\quad\cos\quad\varphi}} \\ v_{z} \end{bmatrix}} \end{matrix}$

A transformation may also be performed to transform coordinates in the Cartesian system to coordinates in cylindrical coordinate system. In general, the coordinates (x₁, x₂, x₃) of a point P_(s) specified in the Cartesian system uniquely define the coordinates (r, φ, z) of the same point P_(t) specified in the cylindrical system. In the special case that the point P_(s) is located on the {overscore (x)}₃-axis, the coordinates (q₁, q₂, q₃) of a vector {overscore (q)}_(s), which is non-parallel to the {overscore (x)}₃-axis, are used to uniquely define the coordinate φ. The algebraic relationship between the coordinates (x₁, x₂, x₃) of the point P_(s) and the coordinates (r, φ, z) of the same point P_(t) is defined by the following equation. $\begin{matrix} {P_{t} = {f_{{{Cart}.}\rightarrow{{Cyl}.}}\left( {P_{s},\overset{\_}{q_{s}}} \right)}} \\ {\begin{bmatrix} r \\ \varphi \\ z \end{bmatrix} = \left\{ \begin{matrix} \begin{bmatrix} \sqrt{x_{1}^{2} + x_{2}^{2}} \\ {{atan}\left( {x_{2},x_{1}} \right)} \\ x_{3} \end{bmatrix} & {{{for}\quad x_{1}} \neq {0\quad{or}\quad x_{2}} \neq 0} \\ \begin{bmatrix} 0 \\ {{atan}\left( {q_{2},q_{1}} \right)} \\ x_{3} \end{bmatrix} & {{{for}\quad x_{1}} = {{0\quad{and}\quad x_{2}} = 0}} \end{matrix} \right.} \end{matrix}$ Similarly, the algebraic relationship between the coordinates (v₁, v₂, v₃) of a vector {overscore (v)}_(s) specified in the Cartesian system and the coordinates (v_(r), v_(φ), v_(z)) of the same vector {overscore (v)}_(t) specified in the cylindrical system at the point P_(s) is defined by the following equation. $\begin{matrix} {\overset{\_}{v_{t}} = {g_{{{Cart}.}\rightarrow{{Cyl}.}}\left( {P_{s},{\overset{\_}{q}}_{s},{\overset{\_}{v}}_{s}} \right)}} \\ {\begin{bmatrix} v_{r} \\ v_{\varphi} \\ v_{z} \end{bmatrix} = \begin{bmatrix} {{v_{1}\quad\cos\quad\varphi} + {v_{2}\quad\sin\quad\varphi}} \\ {{{- v_{1}}\quad\sin\quad\varphi} + {v_{2}\quad\cos\quad\varphi}} \\ v_{3} \end{bmatrix}} \\ {= \left\{ \begin{matrix} \begin{matrix} \left\lbrack \frac{\frac{{v_{1}x_{1}} + {v_{2}x_{2}}}{\begin{matrix} \sqrt{x_{1}^{2} + x_{2}^{2}} \\ {{{- v_{1}}x_{2}} + {v_{2}x_{1}}} \end{matrix}}}{\begin{matrix} \sqrt{x_{1}^{2} + x_{2}^{2}} \\ v_{3} \end{matrix}} \right\rbrack & {{{for}\quad x_{1}} \neq {0\quad{or}\quad x_{2}} \neq 0} \\ \left\lbrack \frac{\frac{{v_{1}q_{1}} + {v_{2}q_{2}}}{\begin{matrix} \sqrt{q_{1}^{2} + q_{2}^{2}} \\ {{{- v_{1}}q_{2}} + {v_{2}q_{1}}} \end{matrix}}}{\begin{matrix} \sqrt{q_{1}^{2} + q_{2}^{2}} \\ v_{3} \end{matrix}} \right\rbrack & \begin{matrix} {{{{for}\quad x_{1}} = 0},{x_{2} = 0},{q_{1} = {\lambda\quad v_{1}}},} \\ {{{and}\quad q_{2}} \neq {\lambda\quad v_{2}}} \end{matrix} \\ \begin{bmatrix} \sqrt{v_{1}^{2} + v_{2}^{2}} \\ 0 \\ v_{3} \end{bmatrix} & \begin{matrix} {{{{for}\quad x_{1}} = 0},{x_{2} = 0},{q_{1} = {\lambda\quad v_{1}}},} \\ {{{and}\quad q_{2}} = {\lambda\quad v_{2}}} \end{matrix} \end{matrix} & \quad \end{matrix} \right.} \end{matrix}$

3. Spherical Coordinate System

Referring now to FIG. 12, FIG. 12 shows the geometric relationship of a three-dimensional spherical coordinate system 120. The coordinate system 120 is defined by coordinate origin O and the three mutually orthogonal coordinate curves {{overscore (r)}, {overscore (φ)}, {overscore (ψ)}} (tangents are orthogonal except along the {overscore (x)}₃-axis). With a linear scale of measurement on the curve {overscore (r)} and a radian scale of measurement on the curves {overscore (φ)} and {overscore (ψ)}, the spherical coordinates (r, φ, ψ) define a point P in spherical coordinate space.

A transformation may be used to transform coordinates in the spherical coordinate system to coordinates in the Cartesian coordinate system. Specifically, the algebraic relationship between the coordinates (r, φ, ψ) of a point P_(s) specified in the spherical system and the coordinates (x₁, x₂, x₃) of the same point P_(t) specified in the Cartesian system is defined by the following equation: $\begin{matrix} {P_{t} = {f_{{{Sph}.}\rightarrow{{Cart}.}}\left( P_{s} \right)}} \\ {\begin{bmatrix} x_{1} \\ x_{2} \\ x_{3} \end{bmatrix} = \begin{bmatrix} {r\quad\cos\quad\varphi\quad\cos\quad\psi} \\ {r\quad\sin\quad\varphi\quad\cos\quad\psi} \\ {r\quad\sin\quad\psi} \end{bmatrix}} \end{matrix}$ Similarly, the algebraic relationship between the coordinates (v_(r), v_(φ), v_(ψ)) of a vector {overscore (v)}_(s) specified in the spherical system and the coordinates (v₁, v₂, v₃) of the same vector v_(t) specified in the Cartesian system at the point P_(s) is defined by the following equation. $\begin{matrix} {\overset{\_}{v_{t}} = {g_{{{Sph}.}\rightarrow{{Cart}.}}\left( {P_{s},\overset{\_}{v_{s}}} \right)}} \\ {\begin{bmatrix} v_{1} \\ v_{2} \\ v_{3} \end{bmatrix} = \begin{bmatrix} {{v_{r}\quad\cos\quad\varphi\quad\cos\quad\psi} + {v_{\varphi}\quad\sin\quad\varphi} - {v_{\psi}\quad\cos\quad\varphi\quad\sin\quad\psi}} \\ {{v_{r}\quad\sin\quad\varphi\quad\cos\quad\psi} + {v_{\varphi}\quad\cos\quad\varphi} - {v_{\psi}\quad\sin\quad\varphi\quad\sin\quad\psi}} \\ {{v_{r}\quad\sin\quad\psi} + {v_{\psi}\quad\cos\quad\psi}} \end{bmatrix}} \end{matrix}$

A transformation may be also used to transform coordinates in the Cartesian coordinate system to coordinates in the spherical coordinate system. In general, the coordinates (x₁, x₂, x₃) of a point P_(s) specified in the Cartesian system uniquely define the coordinates (r, φ, ψ) of the same point P_(t) specified in the spherical system. In the special case that the point P_(s) is located on the {overscore (x)}₃-axis, the coordinates (q₁, q₂, q₃) of a vector {overscore (q)}_(s), which is non-parallel to the {overscore (x)}₃-axis, are used to uniquely define the coordinate φ. The algebraic relationship between the coordinates (x₁, x₂, x₃) of the point P_(s) and the coordinates (r, φ, ψ) of the same point P_(t) is defined by the following equation. $\begin{matrix} {P_{t} = {f_{{{Cart}.}\rightarrow{{Sph}.}}\left( {P_{s},\overset{\_}{q_{s}}} \right)}} \\ {\begin{bmatrix} r \\ \varphi \\ \psi \end{bmatrix} = \left\{ \begin{matrix} \begin{bmatrix} \sqrt{x_{1}^{2} + x_{2}^{2} + x_{3}^{2}} \\ {{atan}\left( {x_{2},x_{1}} \right)} \\ {{atan}\left( {x_{3},\sqrt{x_{1}^{2} + x_{2}^{2}}} \right)} \end{bmatrix} & {{{for}\quad x_{1}} \neq {0\quad{or}\quad x_{2}} \neq 0} \\ \begin{bmatrix} {x_{3}} \\ {{atan}\left( {q_{2},q_{1}} \right)} \\ {{{sgn}\left( x_{3} \right)}\frac{\pi}{2}} \end{bmatrix} & {{{for}\quad x_{1}} = {{0\quad{and}\quad x_{2}} = 0}} \end{matrix} \right.} \end{matrix}$ Similarly, the algebraic relationship between the coordinates (v₁, v₂, v₃) of a vector {overscore (v)}_(s) specified in the Cartesian system and the coordinates (v_(r), v_(φ), v_(ψ)) of the same vector {overscore (v)}_(t) specified in the spherical system at the point P_(s) is defined by the following equation. $\begin{matrix} {\overset{\_}{v_{t}} = {g_{{{Cart}.}\rightarrow{{Sph}.}}\left( {P_{s},\overset{\_}{q_{s}},\overset{\_}{v_{s}}} \right)}} \\ {\begin{bmatrix} v_{r} \\ v_{\varphi} \\ v_{\psi} \end{bmatrix} = \begin{bmatrix} {{v_{1}\quad\cos\quad\varphi\quad\cos\quad\psi} + {v_{2}\sin\quad\varphi\quad\cos\quad\psi} + {v_{3}\sin\quad\psi}} \\ {{{- v_{1}}\quad\sin\quad\varphi} + {v_{2}\quad\cos\quad\varphi}} \\ {{{- v_{1}}\quad\cos\quad\varphi\quad\sin\quad\psi} - {v_{2}\quad\sin\quad\varphi\quad\sin\quad\psi} + {v_{3}\quad\cos\quad\psi}} \end{bmatrix}} \\ {= \left\{ \begin{matrix} \begin{matrix} \left\lbrack \frac{\frac{{v_{1}x_{1}} + {v_{2}x_{2}} + {v_{3}x_{3}}}{\begin{matrix} \sqrt{x_{1}^{2} + x_{2}^{2} + x_{3}^{2}} \\ {{{- v_{1}}x_{2}} + {v_{2}x_{1}}} \end{matrix}}}{\begin{matrix} \sqrt{x_{1}^{2} + x_{2}^{2}} \\ \frac{{{- \left( {{v_{1}x_{1}} + {v_{2}x_{2}}} \right)}x_{3}} + {v_{3}\left( {x_{1}^{2} + x_{2}^{2}} \right)}}{\sqrt{x_{1}^{2} + x_{2}^{2}}\sqrt{x_{1}^{2} + x_{2}^{2} + x_{3}^{2}}} \end{matrix}} \right\rbrack & {{{for}\quad x_{1}} \neq {0\quad{or}\quad x_{2}} \neq 0} \\ \left\lbrack \frac{\frac{{v_{1}q_{1}} + {v_{2}q_{2}} + {v_{3}q_{3}}}{\begin{matrix} \sqrt{q_{1}^{2} + q_{2}^{2} + q_{3}^{2}} \\ {{{- v_{1}}q_{2}} + {v_{2}q_{1}}} \end{matrix}}}{\begin{matrix} \sqrt{q_{1}^{2} + q_{2}^{2}} \\ \frac{{{- \left( {{v_{1}q_{1}} + {v_{2}q_{2}}} \right)}q_{3}} + {v_{3}\left( {q_{1}^{2} + q_{2}^{2}} \right)}}{\sqrt{q_{1}^{2} + q_{2}^{2}}\sqrt{q_{1}^{2} + q_{2}^{2} + q_{3}^{2}}} \end{matrix}} \right\rbrack & \begin{matrix} {{{{for}\quad x_{1}} = 0},{x_{2} = 0},{q_{1} = {\lambda\quad v_{1}}},} \\ {{{and}\quad q_{2}} \neq {\lambda\quad v_{2}}} \end{matrix} \\ \begin{bmatrix} \frac{{\lambda\left( {v_{1}^{2} + v_{2}^{2}} \right)} + {v_{3}q_{3}}}{\sqrt{{\lambda^{2}\left( {v_{1}^{2} + v_{2}^{2}} \right)} + q_{3}^{2}}} \\ 0 \\ \frac{\left( {{\lambda\quad v_{3}} - q_{3}} \right)\sqrt{v_{1}^{2} + v_{2}^{2}}}{\sqrt{{\lambda^{2}\left( {v_{1}^{2} + v_{2}^{2}} \right)} + q_{3}^{2}}} \end{bmatrix} & \begin{matrix} {{{{for}\quad x_{1}} = 0},{x_{2} = 0},{q_{1} = {\lambda\quad v_{1}}},} \\ {{q_{2} = {\lambda\quad v_{2}}},{{{and}\quad q_{3}} \neq {\lambda\quad v_{3}}}} \end{matrix} \\ \begin{bmatrix} \begin{matrix} \sqrt{v_{1}^{2} + v_{2}^{2} + v_{3}^{2}} \\ 0 \end{matrix} \\ 0 \end{bmatrix} & \begin{matrix} {{{{for}\quad x_{1}} = 0},{x_{2} = 0},{q_{1} = {\lambda\quad v_{1}}},} \\ {{q_{2} = {\lambda\quad v_{2}}},{{{and}\quad q_{3}} = {\lambda\quad v_{3}}}} \end{matrix} \end{matrix} & \quad \end{matrix} \right.} \end{matrix}$

4. Other Coordinate Systems

Additional and/or different coordinate systems may also be used. For example, it may be desirable to develop one or more other coordinate systems which are tailored to be used in specific applications. Two such coordinate systems are shown in FIGS. 13-14. In FIG. 13, a coordinate system 140 is shown which is useable in the context of a two-arm robotics application in which the two arms are independently moveable (“independently linked”). In FIG. 14, a coordinate system 150 is shown which is useable in the context of a two-arm robotics application in which the two arms are not independently moveable (“dependently linked”).

a. Independent Coordinate System

Referring first to FIG. 13, the geometric relationship of a left-hand (α₂<0) independent coordinate system is shown. An independent coordinate system is a kinematic system with two independent links. The coordinate origin O, the length of the two links (0<l₁ and 0<l₂), and the two coordinate curves {{overscore (α)}₁,{overscore (α)}₂} define an independent coordinate system. With the same linear scale of measurement on the two links and a radian scale of measurement on the curves {overscore (α)}₁ and {overscore (α)}₂, the independent coordinates (α₁, α₂) define a point P in independent coordinate space.

A transformation may be used to transform coordinates in the independent coordinate system to coordinates in the Cartesian coordinate system. This transformation is sometimes referred to as forward kinematics. The algebraic relationship between the coordinates (α₁, α₂) of a point P_(s) specified in the independent system and the coordinates (x₁, x₂) of the same point P_(t) specified in the Cartesian system is defined by the following equation. $\begin{matrix} {P_{t} = {f_{{{Indep}.}\rightarrow{{Cart}.}}\left( P_{s} \right)}} \\ {\begin{bmatrix} x_{1} \\ x_{2} \end{bmatrix} = \begin{bmatrix} {{l_{1}\quad\cos\quad\alpha_{1}} + {l_{2}{\cos\left( {\alpha_{1} + \alpha_{2}} \right)}}} \\ {{l_{1}\quad\sin\quad\alpha_{1}} + {l_{2}{\sin\left( {\alpha_{1} + \alpha_{2}} \right)}}} \end{bmatrix}} \end{matrix}$

A transformation may also be used to transform coordinates in the Cartesian coordinate system to coordinates in the independent coordinate system. This transformation is sometimes referred to as inverse kinematics. Since the kinematic system can either represent a left-hand (α₂<0) or a right-hand (0≦α₂) system, the result of this transformation is not uniquely defined. However, by establishing one configuration during initialization, the result is uniquely defined from then on.

With the polar coordinates of a point P_(s) $\begin{bmatrix} r \\ \varphi \end{bmatrix} = \begin{bmatrix} {\min\left( {{\sqrt{{x_{1}^{2} + x_{2}^{2}},}l_{1}} + l_{2}} \right)} \\ {{atan}\left( {x_{2},x_{1}} \right)} \end{bmatrix}$ and the sine and cosine rule, the angles β and γ can be derived. First, the cosine rule r ² =l ₁ ² +l ₂ ²−2l ₁ l ₂ cos γ provides the angle $\gamma = {a\quad{\cos\left( \frac{l_{1}^{2} + l_{2}^{2} - r^{2}}{2l_{1}l_{2}} \right)}}$ Second, the sine rule $\frac{\sin\quad\beta}{l_{2}} = \frac{\sin\quad\gamma}{r}$ provides the angle $\beta = \left\{ \begin{matrix} {{asin}\left( {\frac{l_{2}}{r}\sin\quad\gamma} \right)} & {{{for}\quad r} \neq 0} \\ 0 & {{{for}\quad r} = 0} \end{matrix} \right.$ With the above results, the algebraic relationship between the coordinates (x₁, x₂) of a point P_(s) specified in the Cartesian system and the coordinates (α₁, α₂) of the same point P_(t) specified in the independent system is defined by the following equations. Left-Hand System: $\begin{matrix} {p_{t} = {f_{{{Cart}.}\rightarrow{{Indep}.}}\left( P_{s} \right)}} \\ {\begin{bmatrix} \alpha_{1} \\ \alpha_{2} \end{bmatrix} = \begin{bmatrix} {\varphi + \beta} \\ {\gamma - \pi} \end{bmatrix}} \end{matrix}$ Right-Hand System: $\begin{matrix} {p_{t} = {f_{{{Cart}.}\rightarrow{{Indep}.}}\left( P_{s} \right)}} \\ {\begin{bmatrix} \alpha_{1} \\ \alpha_{2} \end{bmatrix} = \begin{bmatrix} {\varphi - \beta} \\ {\pi - \gamma} \end{bmatrix}} \end{matrix}$

b. Dependent Coordinate System

Referring next to FIG. 14, the geometric relationship of a left-hand (α₂<α₁) dependent coordinate system is shown. A dependent coordinate system is a kinematic system with two dependent links. The coordinate origin O, the length of the two links (0<l₁ and 0<l₂), and the two coordinate curves {{overscore (α)}₁, {overscore (α)}₂} define a dependent coordinate system. With the same linear scale of measurement on the two links and a radian scale of measurement on the curves {overscore (α)}₁ and {overscore (α)}₂, the dependent coordinates (α₁, α₂) define a point P in dependent coordinate space.

A transformation may be used to transform coordinates in the dependent coordinate system to coordinates in the Cartesian coordinate system. This transformation is sometimes referred to as forward kinematics. The algebraic relationship between the coordinates (α₁, α₂) of a point P_(s) specified in the dependent system and the coordinates (x₁, x₂) of the same point P_(t) specified in the Cartesian system is defined by the following equation. $\begin{matrix} {P_{t} = {f_{{{Dep}.}\rightarrow{{Cart}.}}\left( P_{s} \right)}} \\ {\begin{bmatrix} x_{1} \\ x_{2} \end{bmatrix} = \begin{bmatrix} {{l_{1}\cos\quad\alpha_{1}} + {l_{2}\quad\cos\quad\alpha_{2}}} \\ {{l_{1}\sin\quad\alpha_{1}} + {l_{2}\quad\sin\quad\alpha_{2}}} \end{bmatrix}} \end{matrix}$

A transformation may also be used to transform coordinates in the Cartesian coordinate system to coordinates in the dependent coordinate system. This transformation is sometimes referred to as inverse kinematics. Since the kinematic system can either represent a left-hand (α₂<α₁) or a right-hand (α₁≦α₂) system, the result of this transformation is not uniquely defined. However, by establishing one configuration during initialization, the result is uniquely defined from then on. With the polar coordinates of a point P_(s) $\begin{bmatrix} r \\ \varphi \end{bmatrix} = \begin{bmatrix} {\min\left( {\sqrt{x_{1}^{2} + x_{2}^{2}},{l_{1} + l_{2}}} \right)} \\ {{atan}\left( {x_{2},x_{1}} \right)} \end{bmatrix}$ and the sine and cosine rule, the angles β and γ can be derived. First, the cosine rule r ² =l ₁ ² +l ₂ ²−2l ₁ l ₂ cos γ provides the angle $\gamma = {a\quad{\cos\left( \frac{l_{1}^{2} + l_{2}^{2} - r^{2}}{2l_{1}l_{2}} \right)}}$ Second, the sine rule $\frac{\sin\quad\beta}{l_{2}} = \frac{\sin\quad\gamma}{r}$ provides the angle $\beta = \left\{ \begin{matrix} {a\quad{\sin\left( {\frac{l_{2}}{r}\sin\quad\gamma} \right)}} & {{{for}\quad r} \neq 0} \\ 0 & {{{for}\quad r} = 0} \end{matrix} \right.$ With the above results, the algebraic relationship between the coordinates (x₁, x₂) of a point P_(s) specified in the Cartesian system and the coordinates (α₁, α₂) of the same point P_(t) specified in the dependent system is defined by the following equations. Left-Hand System: $\begin{matrix} {P_{t} = {f_{{{Cart}.}\rightarrow{{Dep}.}}\left( P_{s} \right)}} \\ {\begin{bmatrix} \alpha_{1} \\ \alpha_{2} \end{bmatrix} = \begin{bmatrix} {\varphi + \beta} \\ {\alpha_{1} + \left( {\gamma - \pi} \right)} \end{bmatrix}} \\ {= \begin{bmatrix} {\varphi + \beta} \\ {\varphi + \beta + \gamma - \pi} \end{bmatrix}} \end{matrix}$ Right-Hand System: $\begin{matrix} {P_{t} = {f_{{{Cart}.}\rightarrow{{Dep}.}}\left( P_{s} \right)}} \\ {\begin{bmatrix} \alpha_{1} \\ \alpha_{2} \end{bmatrix} = \begin{bmatrix} {\varphi - \beta} \\ {\alpha_{1} + \left( {\pi - \gamma} \right)} \end{bmatrix}} \\ {= \begin{bmatrix} {\varphi - \beta} \\ {\varphi - \beta + \pi - \gamma} \end{bmatrix}} \end{matrix}$

B. Coordinated Move Profiles

In the preferred embodiment, the coordinated move block 72 may be used to provide, for example, a linear or circular path in a Cartesian coordinate system from the current position to a new position. For circular moves, the path also either takes into account an auxiliary position that specifies the center of the circle or a position along the circle, or alternately the radius of the circle may be specified in place of an auxiliary position. The actual path over time also depends on the current speed and acceleration, the maximum speed, acceleration, and deceleration as well as the velocity profile type.

1. Linear Move

Referring now to FIG. 15, a coordinated linear move provides a linear path in a multi-dimensional Cartesian coordinate system from a current position P_(c) to a new position P_(n). FIG. 15 shows the geometric relationship of a simple two-dimensional linear move. In general, the ideal line for this move is defined by the old position P_(o), which specifies either the position of a previous coordinated move or the current position P_(c). If there was no previous coordinated move, the old position P_(o) is assumed to be equal to the current position P_(c). Since the actual path generally is not exactly linear due to the current position P_(c), the current velocity {overscore (v)}_(c), and the current acceleration {overscore (a)}_(c), the resulting path is fairly complex. However, the representation of the path can be simplified by transforming the move parameters from the original (target) Cartesian coordinate system to a new (source) Cartesian coordinate system. An appropriate source system is defined by the origin O_(s), which is equal to the old position P_(o), and the coordinate axes {{overscore (x)}_(1,s), . . . , {overscore (x)}_(n,s)}, where n denotes the number of coordinated axes.

The coordinate axes {{overscore (x)}_(1,s), . . . , {overscore (x)}_(n,s)}, are characterized by the mutually orthonormal basis {{overscore (t)}₁, . . . , {overscore (t)}_(n)}, which may be defined by the following procedure.

1. The first m basis vectors {{overscore (t)}₁, . . . , {overscore (t)}_(m)}, can be calculated by applying the auxiliary algorithm of Section II(C), where the vectors {{overscore (t)}₁, . . . , {overscore (r)}_(m)} specify the first m (m<n) mutually independent vectors in the set P_(n)−P_(o), P_(n)−P_(c), {overscore (v)}_(c), and {overscore (a)}_(c). The algorithm in Section II(C) also handles the identification of the first m mutually independent vectors.

2. The remaining n-m basis vectors {{overscore (t)}_(m+1), . . . , {overscore (t)}_(n)} can be calculated by applying the auxiliary algorithm of Section II(C).

The resulting offset vector {overscore (o)}=O_(s)−O_(t) and transformation matrix={overscore (T)}={{overscore (t)}₁, . . . , {overscore (t)}_(n)}, define the source coordinate system. Therefore, the current position P_(c), the new position P_(n), the current velocity {overscore (v)}_(c), and the current acceleration {overscore (a)}_(c) can be transformed from the target to the source system. P _(c,s) ={overscore (T)} ^(T)(P _(c) −{overscore (o)}) P _(n,s) ={overscore (T)} ^(T)(P _(n) −{overscore (o)}) {overscore (v)} _(s) ={overscore (T)} ^(T) {overscore (v _(c) )} {overscore (a)} _(s) ={overscore (T)} ^(T) {overscore (a _(c) )}

In the source system, the multi-dimensional coordinated linear move can be separated into multiple individual one-dimensional moves (m₁ . . . m_(n)). Therefore, the coordinates of the velocity {overscore (v)}_(s) and acceleration {overscore (a)}_(s) represent the start velocity and start acceleration for the individual moves. The distance {overscore (d)}_(s) for all individual moves specified in the source system can be calculated based on the current position P_(c,s) and the new position P_(n,s) specified in the source system. $\begin{matrix} {\overset{\_}{d_{s}} = {P_{n,s} - P_{c,s}}} \\ {= {{{\overset{\_}{T}}^{T}\left( {P_{n} - \overset{\_}{o}} \right)} - {{\overset{\_}{T}}^{T}\left( {P_{c} - \overset{\_}{o}} \right)}}} \\ {= {{\overset{\_}{T}}^{T}\left( {P_{n} - P_{c}} \right)}} \end{matrix}$

During run-time, the interpolator of each individual move block 76 generates incremental position reference values for the coordinates of P_(s) in the source system. With these updates, the incremental position reference values P_(t) in the target system can simply be calculated by applying a coordinate transformation from the source to the target system. P _(t) ={overscore (T)}P _(s) +{overscore (o)}

2. Circular Move

Referring now to FIG. 16, a coordinated circular move provides a circular path in a two- or three-dimensional Cartesian coordinate system from a current position P_(c) to a new position P_(n). FIG. 16 shows the geometric relationship of a simple two-dimensional circular move. In general, the ideal circle for this move is defined by the old position P_(o), which specifies either the position of the previous coordinated move or the current position P_(c), and the auxiliary position P_(a), which specifies either the center of the circle or a position along the circle. (Alternatively, the radius may be specified from which the center is calculated.) If there was no previous coordinated move, the old position P_(o) is assumed to be equal to the current position P_(c). Since the actual path generally is not exactly circular due to the current position P_(c), the current velocity {overscore (v)}_(c), and the current acceleration {overscore (a)}_(c), the resulting path is more complex. However, the representation of the path can be simplified by transforming the move parameters from the original (target) Cartesian coordinate system to a new (source) cylindrical coordinate system. An appropriate source system is defined by the origin O_(s), which is equal to the center of the circle, and the coordinate axes {{overscore (x)}_(1,s), . . . , {overscore (x)}_(n,s)}, where n denotes the number of coordinated axes. However, in order to calculate the origin O_(s), the vector {overscore (n)} that is normal to the plane of the circle needs to be calculated first.

In the general case that the vectors P_(n)−P_(a) and P_(a)−P_(o) are linearly independent and an auxiliary vector {overscore (a)} is not specified, the normal vector {overscore (n)} is defined by the outer product of the vectors P_(n)−P_(a) and P_(a)−P_(o). {overscore (b)}=(P _(n) −P _(a))×(P _(a) −P _(o)) $\overset{\_}{n} = \frac{\overset{\_}{b}}{\overset{\_}{b}}$

However, if the vectors P_(n)−P_(a) and P_(a)−P_(o) are linearly dependent and an auxiliary vector {overscore (a)} is not specified, the circle is not defined.

With the positions P_(a) and P_(o) on the plane of the circle the corresponding projected positions P_(a)′ and P_(o)′ onto the plane of the circle are equal to the original positions. P_(a)′=P_(a) P_(o)′=P_(o) In the special case that an auxiliary vector {overscore (a)} is specified, the normal vector {overscore (n)} is defined by the auxiliary vector {overscore (a)}. $\overset{\_}{n} = \frac{\overset{\_}{a}}{\overset{\_}{a}}$ However, if the auxiliary vector {overscore (a)} is zero, the circle is not defined.

With the positions P_(a) and P_(o) not necessarily on the plane of the circle, the projected positions P_(a)′ and P_(o)′ onto the plane of the circle are calculated. Since a projected position P′ has to be on a straight line, which goes through the original position P and is parallel to the vector {overscore (n)}, P′=P+γ{overscore (n)} and has to be on the plane, which goes through the new position P_(n) and is normal to the vector {overscore (n)}, {overscore (n)} ^(T)(P′−P _(n))=0 the projected position P′ is defined by the following equation. {overscore (n)} ^(T)(P+γ{overscore (n)}−P _(n))=0 γ{overscore (n)} ^(T) {overscore (n)}={overscore (n)} ^(T)(P _(n) −P) γ={overscore (n)} ^(T)(P _(n) −P) P′=P+({overscore (n)} ^(T)(P _(n) −P)){overscore (n)} As a result, the projected positions P_(a)′ and P_(o)′ are defined by the following equations. P _(a) ′=P _(a)+({overscore (n)} ^(T)(P _(n) −P _(a))){overscore (n)} P _(o) ′=P _(o)+({overscore (n)} ^(T)(P _(n) −P _(o))){overscore (n)} If the auxiliary position P_(a) specifies the center of the circle, the origin O_(s) is directly defined. O_(s)=P_(a)′ If the auxiliary position P_(a) specifies a position along the circle, the origin O_(s) is defined by the intersection of the following three planes. $\begin{matrix} {{\left( {P_{n} - P_{a}^{\prime}} \right)^{T}O_{s}} = {\left( {P_{n} - P_{a}^{\prime}} \right)^{T}\frac{P_{n} + P_{a}^{\prime}}{2}}} \\ {{\left( {P_{a}^{\prime} - P_{o}^{\prime}} \right)^{T}O_{s}} = {\left( {P_{a}^{\prime} - P_{o}^{\prime}} \right)^{T}\frac{P_{a}^{\prime} + P_{o}^{\prime}}{2}}} \\ {{{\overset{\_}{n}}^{T}O_{s}} = {{\overset{\_}{n}}^{T}P_{n}}} \end{matrix}$  {overscore (n)} ^(T) O _(s) ={overscore (n)} ^(T) P _(n)

The first plane passes through the mid-point between P_(n) and P_(a)′ and is orthogonal to P_(n)−P_(a)′. The second plane passes through the mid-point between P_(a)′ and P_(o)′ and is orthogonal to P_(a)′−P_(o)′. The third plane passes through the positions P_(n), P_(a)′, and P_(o)′. The origin O_(s) can be found by solving the above set of three linear equations.

However, if the vectors P_(n)−P_(a)′ and P_(a)′−P_(o)′ are linearly dependent, the circle is not defined.

For a two-dimensional circular move, the third plane is defined implicitly and the problem degenerates to a set of two linear equations.

The coordinate axes {{overscore (x)}_(1,s), . . . , {overscore (x)}_(n,s)} are characterized by the mutually orthonormal basis {{overscore (t)}₁, . . . , {overscore (t)}_(n)}, which is defined by the following procedure.

1. With {overscore (r)}₁ representing the first non-zero vector in the set P_(o)′−O_(s) and P_(n)−O_(s), the first basis vector $t_{1} = \frac{{\overset{\_}{r}}_{1}}{r_{1}}$ is defined.

2. With the normal vector {overscore (n)}, the second basis vector {overscore (t)} ₂ ={overscore (n)}×{overscore (t)} ₁ is defined. For a two-dimensional circular move, the normal vector is defined implicitly and the problem degenerates. ${\overset{\_}{t}}_{2} = \begin{bmatrix} {- t_{12}} \\ t_{11} \end{bmatrix}$

3. The third basis vector {overscore (t)}₃ is equal to the normal vector {overscore (n)}.

The resulting offset vector {overscore (o)}=O_(s)−O_(t) and transformation matrix {overscore (T)}={{overscore (t)}₁, . . . , {overscore (t)}_(n)} define not only the source cylindrical coordinate system but also an intermediate Cartesian coordinate system. Therefore, the current position P_(c), the new position P_(n), the current velocity {overscore (v)}_(c), and the current acceleration {overscore (a)}_(c) can be first transformed from the target to the intermediate system. P _(c,i) ={overscore (T)} ^(T)(P _(c) −{overscore (o)}) P _(n,i) ={overscore (T)} ^(T)(P _(n) −{overscore (o)}) {overscore (v _(i) )} ={overscore (T)} ^(T) {overscore (v _(c) )} {overscore (a _(i) )} ={overscore (T)} ^(T) {overscore (a _(c) )}

In the special case that the position P_(c,i) is located on the {overscore (x)}_(3,s)-axis at least one of the vectors in the set {overscore (v)}_(i), {overscore (a)}_(i), and P_(n,i)−P_(c,i), has to be non-parallel to the {overscore (x)}_(3,s)-axis. The first non-parallel vector in the above set defines the vector {overscore (q)}_(i). Therefore, the current position P_(c,i), the new position P_(n,i), the current velocity {overscore (v)}_(i), and the current acceleration {overscore (a)}_(i) can be transformed from the intermediate to the source system. P _(c,s) =f _(Cart.→Cyl.)(P _(c,i) , {overscore (q _(i) )}) P _(n,s) =f _(Cart.→Cyl.)(P _(n,i) ,{overscore (q _(i) )}) {overscore (v)} _(s) =g _(Cart.→Cyl.)(P _(c,i) , {overscore (q _(i) )}, {overscore (v _(i))}) {overscore (a)} _(s) =g _(Cart.→Cyl.)(P _(c,i) , {overscore (q _(i) )}, {overscore (a _(i) )})

In the source system, the two- or three-dimensional coordinated circular move can be separated into two or three individual one-dimensional moves (m₁, m₂, and m₃). Therefore, the coordinates of the velocity {overscore (v)}_(s) and acceleration {overscore (a)}_(s) represent the start velocity and start acceleration for the individual moves. The distance {overscore (d)}_(s) for all individual moves specified in the source system can be calculated based on the current position P_(c,s) and the new position P_(n,s) specified in the source system. {overscore (d)} _(s) =P _(n,s) −P _(c,s)

Since the old position P_(o) and the new position P_(n) split the circle into two arcs, the direction of the path along the circle still needs to be defined. Therefore, the coordinate φ_(d) of {overscore (d)}_(s) may need to be adjusted depending on the direction of the path.

If an auxiliary vector {overscore (a)} is specified, the right-handed screw rule specifies the direction of the path. With the coordinate φ_(c) and φ_(n) of the positions P_(c,s) and P_(n,s) the coordinate φ_(d) of {overscore (d)}_(s) can be adjusted according to the following algorithm. φ_(d)=φ_(n)−φ_(c)

-   -   if d<0         φ_(d)+=2π

If an auxiliary vector {overscore (a)} is not specified, the old position P_(o) needs to be transformed from the target to the source system. P _(o,i) ={overscore (T)} ^(T)(P _(o) ′−{overscore (o)}) P _(o,s) =f _(Cart.→) _(Cyl.) _(.)(P _(o,i) , {overscore (q _(i) )})

If an auxiliary vector {overscore (a)} is not specified and the auxiliary position P_(a) specifies the center of the circle, the shorter arc defines the direction of the path. With the coordinates φ_(o), φ_(s), and φ_(n) of the positions P_(o,s), P_(c,s), and P_(n,s) the coordinate φ_(d) of {overscore (d)}_(s) can be adjusted according to the following algorithm. if φ_(o) < φ_(n)   if φ_(n) − φ_(o) < π     direction = positive   else     direction = negative else   if φ_(o) − φ_(n) < π     direction = negative   else     direction = positive φ_(d) = φ_(n) − φ_(c) if direction = = positive   if φ_(d) < 0     φ_(d) + = 2π else   if 0 < φ_(d)     φ_(d) − = 2π

If an auxiliary vector {overscore (a)} is not specified and the auxiliary position P_(a) specifies a position along the circle, the arc, which includes the auxiliary position P_(a), defines the direction of the path. Therefore, the auxiliary position P_(a) needs to be transformed from the target to the source system. P _(a,i) ={overscore (T)} ^(T)(P _(a) ′−{overscore (o)}) P _(a,s) =f _(Cart.→Cyl.)(P _(a,i) , {overscore (q _(i) )})

With the coordinates φ_(o), φ_(c), φ_(a), and φ_(n) of the positions P_(o,s), P_(c,s), P_(a,s), and P_(n,s) the coordinate φ_(d) of {overscore (d)}_(s) can be adjusted according to the following algorithm. if φ_(o) < φ_(n)   if φ_(o) < φ_(a) and φ_(a) < φ_(n)     direction = positive   else     direction = negative else   if φ_(n) < φ_(a) and φ_(a) < φ_(o)     direction = negative   else     direction = positive φ_(d) = φ_(n) − φ_(c) if direction = = positive   if φ_(d) < 0     φ_(d) + = 2π else   if 0 < φ_(d)     φ_(d) − = 2π

During run-time each individual move generates position updates for the coordinates of P_(s) in the source system. With these updates, the position updates P_(t) in the target system can simply be calculated by applying a coordinate transformation from the source to the target system. P _(t) ={overscore (T)}f _(Cyl.→) _(Cart.) (P _(s))+{overscore (o)}

3. Blended Move

Referring now to FIG. 17, in general, the transition from one move to the next move simply involves using the dynamics of the current move as start dynamics for the next move. However, this might not generate the desired path in all circumstances. An example would be a straight transition from a linear move to a circular move. In one embodiment, the coordinated move block 72 causes a transitioning path segment to be generated which approaches the circle quickly instead of continuing the linear move until the transition position P_(o).

In the preferred embodiment, since this behavior is not always desired, the concept of blended moves is also supported. This blending method provides transitioning at speed from the current move to the next move at or before the transition position P_(o). The resulting path is shown in FIG. 17.

The blending algorithm preferably comprises the following:

1. Calculate the distance d along the ideal path from the old position P_(o) to the new position P_(n). Based on the type of the next move this can be a linear or circular path.

2. Scale the distance d with the scaling value s which is based on the tangential vectors {overscore (t)}_(o) and {overscore (t)}_(n). $\begin{matrix} {r = \frac{{\overset{\_}{t}}_{o}{\overset{\_}{t}}_{n}}{{{\overset{\_}{t}}_{o}}{{\overset{\_}{t}}_{n}}}} \\ {s = \left\{ \begin{matrix} r & {{{for}\quad r} > 0} \\ 0 & {{{for}\quad r} \leq 0} \end{matrix} \right.} \\ {d^{\prime} = {sd}} \end{matrix}$  d′=sd

3. Initiate an incremental move along the ideal path of the current move of distance d′. Based on the type of the current move this can be a linear or circular move.

4. Transition to the next move at or before the old position P_(o) based on the specified transition range.

Due to the general approach of this algorithm, any combination of linear and circular move can be blended.

C. Auxiliary Algorithms

The two auxiliary algorithms described in this subsection may be used to calculate the transformation matrices for the coordinate transformations and coordinated moves.

1. Transformation to Orthonormal Basis Vectors

Given the set of basis vectors {{overscore (r)}₁, . . . , {overscore (r)}_(k)} in n-dimensional space, this algorithm calculates the corresponding mutually orthonormal basis vectors {{overscore (t)}₁, . . . , {overscore (t)}_(m)} using the Gram-Schmidt orthogonalization method. Even though this method is not as numerically reliable as the singular value or QR decomposition method, the number of required mathematical operations for the typical number of basis vectors is smaller.

Initially, all vectors in the set {{overscore (r)}₁, . . . , {overscore (r)}_(k)} that are zero are removed from the set. Then, the first orthonormal basis vector ${\overset{\_}{t}}_{1} = \frac{{\overset{\_}{r}}_{1}}{r_{1}}$ is defined. The remaining orthonormal basis vectors {{overscore (t)}₂, . . . , {overscore (t)}_(m)} are calculated iteratively. First, the basis vector ${\overset{\_}{s}}_{i} = {{\overset{\_}{r}}_{i} - {\overset{i - 1}{\sum\limits_{j = 1}}{\left( {{\overset{\_}{r}}_{i}^{T}{\overset{\_}{t}}_{j}} \right){\overset{\_}{t}}_{j}}}}$ is calculated. If the basis vector {overscore (r)}_(i) is linearly dependent to the basis vectors {{overscore (t)}₁, . . . , {overscore (t)}_(i−1)} the resulting vector {overscore (s)}_(i) is zero and both {overscore (r)}_(i) and {overscore (s)}_(i) are removed from the set. Otherwise, the basis vector {overscore (s)}_(i) is orthogonal to the basis vectors {{overscore (t)}₁, . . . , {overscore (t)}_(i−1)}. Second, the corresponding orthonormal basis vector ${\overset{\_}{t}}_{i} = \frac{{\overset{\_}{s}}_{i}}{{\overset{\_}{s}}_{i}}$ is defined.

2. Complementation of Orthonormal Basis Vectors

Given the mutually orthonormal basis vectors {{overscore (t)}₁, . . . , {overscore (t)}_(m)} in n-dimensional space, this algorithm calculates the complementing mutually orthonormal basis vectors {{overscore (t)}_(m+1), . . . , {overscore (t)}_(n-1)}.

The first n−m−1 basis vectors {{overscore (t)}_(m+1), . . . , {overscore (t)}_(n-1)} are calculated iteratively. First, the basis vector ${\overset{\_}{s}}_{i}^{T} = \left\lbrack {\underset{\underset{i}{︸}}{\tau_{i1}\quad\cdots\quad\tau_{ii}}\quad\underset{\underset{n - i}{︸}}{0\quad\cdots\quad 0}} \right\rbrack$ is defined by the cofactors τ_(ij) that correspond to the element t_(ij) of the transformation submatrix $\overset{\sim}{T} = \begin{bmatrix} t_{11} & \cdots & t_{i1} \\ \vdots & ⋰ & \vdots \\ t_{1i} & \cdots & t_{ii} \end{bmatrix}$ If the resulting vector {overscore (s)}_(i) is zero, it can not be used as basis vector and is replaced with ${\overset{\_}{s}}_{i}^{T} = \left\lbrack {\underset{\underset{i - 1}{︸}}{0\quad\cdots\quad 0}\quad 1\quad\underset{\underset{n - i}{︸}}{0\quad\cdots\quad 0}} \right\rbrack$ Due to the above definitions and the following equation $\begin{matrix} {{{\overset{\_}{s}}_{i}^{T}{\overset{\_}{t}}_{j}} = {\begin{bmatrix} {\tau_{i1}\quad\cdots\quad\tau_{ii}} & {0\quad\cdots\quad 0} \end{bmatrix}\begin{bmatrix} t_{j1} \\ \vdots \\ t_{ji} \\ t_{j,{i + 1}} \\ \vdots \\ t_{jn} \end{bmatrix}}} \\ {= {{\tau_{i1}t_{j1}} + \cdots + {\tau_{ii}t_{ji}}}} \\ {= {\det\begin{bmatrix} t_{11} & \cdots & t_{{i - 1},1} & t_{j1} \\ \vdots & ⋰ & \vdots & \vdots \\ t_{1i} & \cdots & t_{{i - 1},i} & t_{ji} \end{bmatrix}}} \end{matrix}$ the basis vector {overscore (s)}_(i) satisfies the following condition. {overscore (s)}_(i) ^(T){overscore (t)}_(j)=0 for j<i

Therefore, the basis vector {overscore (s)}_(i) is orthogonal to the basis vectors {{overscore (t)}₁, . . . , {overscore (t)}_(i−1)}. Second, the corresponding orthonormal basis vector $t_{i} = \frac{\overset{\_}{s}i}{{\overset{\_}{s}i}}$ is defined. The calculation of the last orthonormal basis vector {overscore (t)}_(n) can be simplified, since the transformation matrix {overscore (T)}=└{overscore (t)}₁, . . . , {overscore (t)}_(n)┘ is orthogonal. $\begin{matrix} {{{\overset{\_}{T}}^{T}\overset{\_}{T}} = {\begin{bmatrix} {\overset{\_}{t}}_{i}^{T} \\ \vdots \\ {\overset{\_}{t}}_{n}^{T} \end{bmatrix}\left\lbrack {{\overset{\_}{t}}_{1}\quad\cdots\quad{\overset{\_}{t}}_{n}} \right\rbrack}} \\ {= \begin{bmatrix} {{\overset{\_}{t}}_{1}^{T}{\overset{\_}{t}}_{\overset{\_}{1}}} & \cdots & {{\overset{\_}{t}}_{1}^{T}{\overset{\_}{t}}_{n}} \\ \vdots & ⋰ & \vdots \\ {{\overset{\_}{t}}_{n}^{T}{\overset{\_}{t}}_{\overset{\_}{1}}} & \cdots & {{\overset{\_}{t}}_{n}^{T}{\overset{\_}{t}}_{n}} \end{bmatrix}} \\ {= \overset{\_}{I}} \end{matrix}$

This orthogonality equation can be used to determine the determinant of the transformation matrix {overscore (T)}. {overscore (T)}^(T){overscore (T)}={overscore (I)} det{overscore (T)}^(T){overscore (T)}=1 det{overscore (T)}^(T)det{overscore (T)}=1 (det{overscore (T)})²=1 det{overscore (T)}=1

In addition, the orthogonality equation can be restated using the above result, Cramer's rule, and the cofactors τ_(ij) that correspond to the element t_(ij) of the transformation matrix {overscore (T)}. $\begin{matrix} {{\overset{\_}{T}}^{T} = {\overset{\_}{T}}^{- 1}} \\ {= {\frac{1}{\det\overset{\_}{T}}\begin{bmatrix} \tau_{11} & \cdots & \tau_{1n} \\ \vdots & ⋰ & \vdots \\ \tau_{n1} & \cdots & \tau_{nn} \end{bmatrix}}} \\ {= \begin{bmatrix} \tau_{11} & \cdots & \tau_{1n} \\ \vdots & ⋰ & \vdots \\ \tau_{n1} & \cdots & \tau_{nn} \end{bmatrix}} \end{matrix}$

Therefore, the last orthonormal basis vector {overscore (t)}_(n) is defined by the following equation. ${\overset{\_}{t}}_{n} = \begin{bmatrix} \tau_{n1} \\ \vdots \\ \tau_{nn} \end{bmatrix}$ III. Instructions

Referring now to FIGS. 18-24, as mentioned above, motion control operations including move operations are achieved through the use of one or more multi-axis coordination instructions 31. The multi-axis coordination instructions 31 are part of the same programming language (e.g., a ladder logic programming language) as the instructions used in connection with the blocks shown in FIG. 2. Assuming an object-orientated approach is used, the multi-axis coordination instructions 31 invoke the services of the coordinated move block 72 and the coordinate transformation block 74.

FIGS. 18-22 show the multi-axis instructions 31 as they appear to the programmer in one embodiment in which the instructions are instructions in a ladder logic programming language. The axes representing a Cartesian coordinate system can be moved to a new position using a coordinated move instruction 200 (FIG. 18), and can be issued on the fly path dynamic changes using a change coordinated dynamics instruction 500 (FIG. 21). In addition, the axes representing a target coordinate system can be locked to the axes representing a source coordinate system using the coordinate transformation instruction 300 (FIG. 19). Further, a position specified in the source coordinate system can be transformed into the same position specified in the target coordinate system using the calculate target position instruction 400 (FIG. 19). The axes involved in a coordinate system may be stopped together using the coordinated stop instruction 600 (FIG. 22). All instructions are part of the group of motion move instructions. FIGS. 23-24 show alternative embodiments of the coordinated move instruction 200.

A. Coordinated Move Instruction 200

Referring now to FIG. 18, in a first embodiment, a linear or circular coordinated move for the specified motion control axes within a Cartesian coordinate system may be initiated using a coordinated move instruction 200. FIG. 18 shows an exemplary ladder faceplate of the coordinated move instruction 200. A linear move approaches the new position directly. A circular move approaches the new position by circling either around or via the auxiliary position. The new and auxiliary positions can be defined as absolute or incremental position.

The coordinated move instruction 200 has operands 210-244 as shown in FIG. 18. As described below, the operands 210-244 are used to specify user-configurable parameters that configure the coordinated move initiated by execution of the coordinated move instruction 200. These operands will now be described in greater detail.

The coordinate system operand 210 specifies the group of motion control axes which span the coordinates (x₁, . . . , x_(n)) of a Cartesian coordinate system. The group of motion control axes correspond to axes of movement as defined by physical hardware (e.g., motors 27 and/or related hardware). The coordinate system may support up to thirty-two axes or more, depending on system configuration.

The motion control operand 212 provides information via bits 213. The bits 213 include an enable bit (EN) which is set when the rung transitions from false to true and which is reset when the rung transitions from true to false, a done bit (DN) which is reset when the rung transitions from false to true and which is set when the coordinated move has been initiated successfully, an error bit (ER) which is reset when the rung transitions from false to true and which is set when the coordinated move has not been initiated successfully, an in process bit (IP) which is set when the coordinated move has been initiated successfully and which is reset when the coordinated move reaches the new position or when the coordinated move is superseded by another coordinated move instruction or terminated by some other motion instruction, and a process complete bit (PC) which is reset when the rung transitions from false to true and which is set when the coordinated move reaches the new position. In addition to providing information via the bits 213, the coordinated move instruction 200 may also have other indicators such as error code indicators.

The move type operand 214 defines the path type of the coordinated move. In one embodiment, the coordinated move instruction 200 may be used for linear or circular move profiles. In this embodiment, the move type may be set to absolute linear (the axes move directly to the new position, which is defined by the position array), incremental linear (the axes move directly to the new position, which is defined by the sum of the position array and the old position), absolute circular (the axes move along a circular path to the new position, which is defined by the position array), or incremental circular (the axes move along a circular path to the new position, which is defined by the sum of the position array and the old position). Depending on the selected transition type operand 238, the current position or the position of the previous coordinated move defines the old position.

The position operand 216 defines either the new absolute or incremental position, depending on the value of the move type operand 214. The position operand 216 is a one-dimensional array, whose dimension is defined by the number of specified axes.

The auxiliary type operand 218 specifies how the auxiliary position operand 220 defines the circle if the move type operand 214 is set to circular. (If the move type operand 214 is set to linear, the specification of the auxiliary type is irrelevant/not used.) In one embodiment, the auxiliary type operand 218 may be set to absolute center (the auxiliary position array defines the center of the circle), incremental center (the sum of the auxiliary position array and the old position defines the center of the circle), absolute via (the auxiliary position array defines a position along the circle), or incremental via (the sum of the auxiliary position array and the old position defines a position along the circle). Depending on the value of the transition type operand 238, the current position or the position of the previous coordinated move defines the old position.

The auxiliary position operand 220 defines either the absolute or incremental auxiliary position, depending on the value of the auxiliary type operand 218. The auxiliary position operand 220 is a one-dimensional array, whose dimension is defined by the number of specified axes. If the move type operand 214 is set to linear, the specification of the auxiliary position operand 220 is optional. However, if the move type operand 214 is set to circular, the auxiliary position operand 220 specifies the center of the circle or a position along the circle.

The auxiliary vector operand 222 defines a vector that is normal to the plane of the circle if the move type operand 214 is set to circular. If the auxiliary type operand 218 is set to center, the direction of the auxiliary vector specifies the rotational direction of the circular move according to the right-handed screw rule. The auxiliary vector operand 222 is a one-dimensional array, whose dimension is defined by the number of specified axes. In general, the specification of the auxiliary vector operand 222 is optional. However, the auxiliary vector operand 214 may be specified when the move type operand 214 is set to circular and the vectors from the old position to the auxiliary position and from the auxiliary position to the new position are linearly dependent. The auxiliary vector operand 214 may also be specified when the move type operand 214 is set to circular, the auxiliary type operand 218 is set to center, and the rotational direction should not follow the shorter arc.

The speed operand 224, accel rate operand 228, and decel rate operand 232 define the maximum speed, acceleration, and deceleration along the path of the coordinated move. The speed units operand 226, accel units operand 230, and decel units operand 234 define the units that are applied to the values of speed, accel rate, and decel rate, where the maxima represent the maxima of the first coordinate system and the units represent coordination units. The profile operand 236 specifies whether the velocity profile of the coordinated move follows a trapezoidal or S-curve profile.

The transition type operand 238 defines the old position, which is used to establish the ideal path to the new position, and the transition schedule, which defines when the coordinated axes will start transitioning to the new position. The transition type operand 238 may be set to various values as indicated below. Transition Type Behavior Direct The current position defines the old position. The coordinated axes immediately start moving to the new position. Immediate The position of the previous coordinated move defines the old position. If there was no previous coordinated move, the old position is assumed to be equal to the current position. The coordinated axes immediately start transitioning to the new position. Decel The position of the previous coordinated move defines the old position. If there was no previous coordinated move, the old position is assumed to be equal to the current position. When the previous coordinated move starts to decelerate, the coordinated axes start transitioning to the new position. Position The position of the previous coordinated move defines the old position. If there was no previous coordinated move, the old position is assumed to be equal to the current position. When the remaining position of the previous coordinated move is less than the transition range, the coordinated axes start transitioning to the new position. Position The position of the previous coordinated move and defines the old position. If there was no previous Blended coordinated move, the old position is assumed to be equal to the current position. When the remaining position of the previous coordinated move is less than the transition range, the coordinated axes start transitioning to the new position along a blended path.

The merge operand 242 specifies whether or not to turn either all the motion or just the coordinated portion of the move into a pure coordinated move for all axes in the coordinated system: Merge Behavior Disabled Any currently executing single axis motion instructions involving any axes defined in the specified coordinate system will not be affected by the activation of this instruction, and will result in superimposed motion on the affected axes. Also, any coordinated motion instructions involving the same specified coordinate system will run to completion based on its termination type. Coordinated Any currently executing coordinated motion Motion instructions involving the same specified coordinate system will be terminated, and the prior motion will be merged into the current move at the speed defined in the merge speed parameter. Also, any pending coordinated motion instructions will be cancelled. Any currently executing system single axis motion instructions involving any axes defined in the specified coordinate system will not be affected by the activation of this instruction, and will result in superimposed motion on the affected axes All Motion Any currently executing single axis motion instructions involving any axes defined in the specified coordinate system, and any currently executing coordinated motion instructions involving the same specified coordinate system, will be terminated, and the prior motion will be merged into the current move at the speed defined in the merge speed parameter. Also, any pending coordinated motion instructions will be cancelled. If the merge is enabled, the merge speed operand 244 defines the maximum speed along the path of the coordinated move.

B. Coordinate Transformation Instruction 300

The coordinate transformation 300 instruction initiates a coordinate transformation between the specified source and target coordinate system axes. Based on the type of the source and target system and the specified parameters, some or all of the following steps are performed: Transformation of the source system to a Cartesian coordinate system; rotation of the Cartesian coordinate system with the rotation matrix {overscore (R)}; translation of the Cartesian coordinate system with the offset vector {overscore (o)}; and/or transformation of the Cartesian coordinate system to the target system. The transformation matrix {overscore (T)} can be calculated from the rotation matrix {overscore (R)}; by applying the auxiliary algorithm of Section II(C)(2). Therefore, the algebraic relationship between the source and target system is defined by: P _(t) =f _(Cart.→Target)({overscore (T)}f _(Source→Cart.)(P _(s))+{overscore (o)}) Before executing the coordinate transformation instruction 300, the target axes may be moved to the position that corresponds to the position of the source axes and the specific coordinate transformation. The user can calculate the required position of the target axes using the calculate target position instruction 400.

The ladder faceplate of a three-dimensional coordinate transformation instruction 300 is shown in FIG. 19. The coordinate transformation instruction 300 has operands 310-320. The target and source coordinate system operands 310 and 312 specify the reference frames used to describe a set of individual axis positions. The following table shows the relevant coordinate systems, their dimension (n), and the notation used to describe the individual axis positions. The coordinate transformation instruction 300 supports transformations to and from each of the following coordinate systems: Cartesian, articulated cylindrical, articulated independent (e.g., 2, 3, or 4 axes), articulated dependent (e.g., 2, 3, or 4 axes), polary/cylindrical, SCARA independent, SCARA dependent, spherical. (A SCARA: (Selective Compliance Assembly Robot Arm) coordinate system is used for a combination of cylindrical and revolute configurations operating in the horizontal plane. This arrangement includes three linked arms with two rotary joints to provide movement in the horizontal plane; vertical movement is provided at the end of the arm.) Other coordinate system transformations may also be supported.

The maximum number of target or source axes defines the actual dimension of the coordinate transformation. If the number of target axes is higher than the number of the source axes, the coordinates for the missing source axes are assumed to be zero. In the case of an independent or dependent system, the coordinate transformation instruction 300 establishes a left-hand or right-hand configuration based on the initial angular coordinates. Thereafter, the established configuration is maintained. Hence, the coordinate transformation instruction 300 provides multi-dimensional coordinate transformations with the maximum dimension dependent on the selected source and target system.

For a linear coordinate, the coordinate value represents coordination units, which are defined by the coordination constant. For an angular coordinate such as φ, ψ, α₁, or α₂, the coordinate value represents radians.

The target and source coordinate systems preferably support up to n axes (e.g., n=32, depending on system configuration). Note that for some transformations the target and source systems may contain the same axes.

The motion control operand 314 provides information via bits 315 which operate in generally the same manner as the bits 213 of FIG. 18. In addition to providing information via the bits 315, the coordinate transformation instruction 300 may also have other indicators such as error code indicators.

The rotation matrix {overscore (R)} operand 316 defines the transformation matrix that is used to rotate the Cartesian coordinate system. It is a two-dimensional array, whose dimensions are defined by the maximum number of specified target or source axes. However, the specification of the rotation matrix is optional. If the rotation matrix is not specified it is assumed to be a unit matrix.

The offset vector {overscore (o)} operand 318 defines the translation of the Cartesian coordinate system. It is a one-dimensional array, whose dimension is defined by maximum number of specified target or source axes. However, the specification of the offset vector is optional. If the offset vector is not specified it is assumed to be zero.

The master reference operand 320 specifies whether the actual or command position of the source axes should be transformed. The transformation may be bidirectional. Transformation preferably may however only occur in one direction at a time. The direction of transfer is only dependent on which side (source or target) the command is being generated.

C. Other Instructions

FIGS. 20-22 show other instructions that may be employed in connection with one or both of the coordinated move block 72 and the coordinate transformation block 74. These instructions include a calculate target position instruction 400, a change coordinated dynamics instruction 500, and axis coordinated stop instruction 600.

The calculate target position instruction 400 transforms a specified position from the source coordinate system into the target coordinate system. The calculate target position instruction 400 provides multi-dimensional coordinate transformations with the maximum dimension dependent on the selected source and target system. Based on the type of the source and target system and the specified parameters, some or all of the following steps are performed: transformation of the source system to a Cartesian coordinate system; rotation of the Cartesian coordinate system with the rotation matrix {overscore (R)}; translation of the Cartesian coordinate system with the offset vector {overscore (o)}; and/or transformation of the Cartesian coordinate system to the target system. Therefore, the algebraic relationship between the source and target system is defined by: P _(t) =f _(Cart.→Target)(Tf _(Source→Cart.)(P _(s))+{overscore (o)}) The ladder faceplate of a calculate target position instruction 400 is shown in FIG. 20.

The change coordinated dynamics instruction 500 initiates a change in dynamics for the specified coordinate system motion. Based on the specified motion type, the change coordinated dynamics instruction 500 changes the coordinated move (or jog) motion profile active on the specified system. In case of a coordinated move, the change coordinated dynamics instruction 500 changes the dynamics for the active as well as the pending coordinate move. The ladder faceplate of the change coordinated dynamics instruction 500 is shown in the FIG. 21.

The axis coordinated stop instruction 600 initiates a controlled stop of the specified coordinate system motion or transformation. Based on the specified stop type, the axis coordinated stop instruction 600 stops either all motion profiles or only a specific motion profile of the specified coordinate system. The ladder faceplate of the axis coordinated stop instruction 600 is shown in FIG. 22.

FIGS. 23-24 show an alternative embodiment of the coordinated move instruction 200. In the embodiment as shown in FIGS. 23-24, separate instructions are provided for linear moves and for circular moves.

The major differences between these two embodiments will now be described in greater detail. Since a separate instruction is used in this embodiment for linear and circular, the instruction used defines the type of move to be performed, either linear or circular.

FIG. 23 shows a linear instruction in accordance with this embodiment. The only two parameters that are different from the previous embodiment for linear are move type 500 and termination type 502. The move type 500 is used to define if the move is absolute or incremental. The definition of absolute and incremental is the same as the previous embodiment.

The termination type 502 is defined as follows: Transition Type Behavior Actual When the vector position lag for the primary axes Tolerance and the position lag for each ancillary axis is less than the actual tolerance, the instruction will terminate. The position lag is the actual position minus the commanded position and is computed after the entire linear move has been interpolated, that is, when the distance to go equals zero. A possible following instruction can then begin No Settle When the vector position lag for the primary axes and the position lag for each ancillary axis is less than the actual tolerance, the instruction will terminate. The position lag is the actual position minus the commanded position and is computed after the entire linear move has been interpolated, that is, when the distance to go equals zero. A possible following instruction can then begin. Command When the vector distance-to-go for the primary axes Tolerance and the distance-to-go for each ancillary axis is less than the command tolerance, the instruction will terminate. The distance-to-go is the distance from the programmed endpoint to the commanded position. A possible following instruction can then begin. If there is no following instruction, the move will degenerate to No Settle. No Decel When the entire linear move has been interpolated up to the deceleration point, the instruction will terminate. The deceleration point of the move is dependent on the profile chosen (trapezoidal or S- curve). A possible following instruction can then begin. If there is no following instruction, the move will degenerate to No Settle.

In addition to all the bits defined for the previous embodiment, this embodiment has an (AC) bit which is set when the instruction is being executed. There is a queue of instructions which have been partially processed. The AC bit indicates which of the instructions is being executed.

FIG. 23 shows a circular instruction for this embodiment. The following five operands are different from the previous embodiment: move type 504, circle type 505, via/center/radius 506, direction 507 and termination type 508.

The move type operand 504 is defined as described above in connection with the move type operand 500. The circle type operand 505 describes the type of circle being programmed. It defines how to interpret the via/center/radius operand 506. The circle type operand 505 specifies if the value given in the operand 506 should be used as a point along the arc of the circle or the circle center, or the circle radius.

The via/center/radius operand 506 defines an array which is interpreted as defined by the operand 505, i.e., a point on the circle as an absolute via (the array value defines a position along the circle), or an incremental via (the sum of the array value and the old position defines a position along the circle) or the absolute center or an incremental center (the sum of the array value and the old position defines the center of the circle), or the radius of the circle.

The direction operand 507 specifies the rotational direction of the circular move according to the right-handed screw rule for a two dimensional circle and the shortest/longest path for a 3 dimensional circle. The termination type operand 508 for circular is defined to be the same as it is for linear.

IV. Bézier Spline Interpolation

Referring now to FIGS. 25-31, in another embodiment, rather than implement the coordinated move block 72 using coordinate transformations, the coordinated move block 72 is implemented using Bézier spline interpolation. According to this approach, the user is permitted to specify a plurality of weighting points in order to define a path profile. In response, the coordinated move block 72 generates a smooth path based on the specific boundary conditions which passes near the weighting points.

Referring specifically to FIG. 25, FIG. 25 shows an example of a Bézier spline curve which may be generated by the coordinated move block 72. In FIG. 25, the user has specified five weighting points W₀-W₄. However, the user may also specify the starting and ending dynamics instead of the starting and ending weighting point W₀ and W₄. It will be understood that the number and placement of weighting points may vary from case to case as specified by the user. The weighting points may be specified by the user using the coordinated move instruction 200 or similar instruction modified to incorporate a plurality of fields configured to receive such weighting points. Based on the boundary control points X₀ and X₁₂ and the weighting points W₀-W₄, the coordinated move block 72 identifies a plurality of control points (shown as points X₁-X₁₁) and an associated plurality of polynomial path segments (shown as polynomials P₀-P₃). Again, it will be understood that the number and arrangement of control points and polynomial segments varies based on the weighting points specified by the user.

In the example of FIG. 25, the endpoints of the path profile are defined by the control points X₀ and X₁₂. Thus, the move starts at the control point X₀ with a starting velocity {overscore (v_(s))} and a starting acceleration {overscore (a_(s))} (determined by the previous move) and ends at the control point X₁₂ with an ending velocity {overscore (v_(e))} and an ending acceleration {overscore (a_(e))} (determined by the next move). As will be detailed below, the remaining control points (X₁-X₁₁) are then calculated such that the first and second derivatives of the spline segments at the transition points (X₃, X₆, X₉) between the path segments are equal. The path passes through the transition points but typically does not pass through the remaining control points. In the context of a path profile, where the curve represents position as a function of time, the control points are calculated such that the velocity vectors and the acceleration vectors are equal for adjacent path segments at the transition points. Also, within the constraint that the first and second derivatives must be equal for adjacent path segments, the remaining control points (X₁-X₁₁) are calculated such that the path segments (P₀-P₃) pass near the weighting points (W₀-W₄). The control points may be calculated by a separate calculation instruction or during an initial phase of a coordinated move instruction.

In the general case, the user may specify m+1 weighting points {W₀ . . . W_(m)} resulting in m path segments {P₀ . . . P_(m−1)} Hence, in the example of FIG. 25, where five weighting points W₀-W₄ are specified, there are four polynomial path segments P₀-P₃. For each path segment P_(j) (where j=0, 1, 2, 3, depending on the path segment), a plurality of coefficient vectors {overscore (c_(0,j))}, {overscore (c_(1,j))}, {overscore (c_(2,j))}, and {overscore (c_(3,j))} is calculated (not shown in FIG. 25). The control vectors are calculated based on a subset of the control points (X_(3j) ^(, X) _(3j+1), X_(3j+2), X_(3j+3)). For example, for the path segment P₁, the control vectors are calculated based on the control points X₃, X₄, X₅, and X₆, with the control points X₃ and X₆ being the transition points for the path segment P₁. The control point X₆ is also a transition point for the path segment P₂, and therefore, the coefficient vectors {overscore (c_(0,j))}, {overscore (c_(1,j))}, {overscore (c_(2,j))}, and {overscore (c_(3,j))} for the two path segments are calculated such that the starting velocity and acceleration vectors for the path segment P₂ are equal to the ending velocity and acceleration vectors for the path segment P₁ at the transition point X₆.

The coefficient vectors {overscore (c_(0,j))}, {overscore (c_(1,j))}, {overscore (c_(2,j))}, and {overscore (c_(3,j))} are used during the dynamic phase of the profile generation (e.g., as the controlled element is moving) to calculate the current position, that is, to calculate the position reference values for the motion controllers 23. The Bézier spline polynomial is configured to provide the geometry of the path as a function of individual parameters u_(j) which vary between 0 and 1 but which may in turn be specified as a function of time. Accordingly, the position reference values may be generated as a function of time and provided to the motion control loops to control operation of each of the motion control axes. Each calculated P_(j) value specifies the position of the curve in multiple dimensions (i.e., a multi-dimensional array), such that one coordinate may be provided to each of the plurality of motion control loops.

As in the case of the coordinate transformation technique described above in Section II, Bézier spline interpolation may be used to generate transitioning path segments between a variety of types of path segments including linear, circular, and curved path segments. Also, rather than using Bézier spline interpolation only for transitioning path segments, the entire path could be constructed using Bézier spline interpolation. Because the path is calculated such that the velocity and acceleration are constant at path transition points and at the endpoints, Bézier spline interpolation provides a smooth path between points in space. Likewise, the calculations are sufficiently simple such that it is possible to change the profile dynamically during path execution.

In Section IV(A), a mathematical characterization is provided of a single segment of a Bézier spline. Based on this knowledge and the requirement of smooth boundary conditions, Section IV(B) derives the general algorithm for Bézier spline interpolation. Section IV(C) provides the specific algorithms for Bézier splines transitions such as blending to and from linear, circular, or curved motion profiles. Section IV(D) describes the dynamics of a Bézier spline.

A. Mathematical Characterization of Single Bézier Spline Segment

In this section, an equation for a single exemplary Bézier spline segment is provided. Initially, in this section, the exemplary Bézier may be any one of a starting path segment, an intermediate path segment, or an ending path segment in a Bézier path comprising multiple adjacent Bézier path segments. From the Bézier spline equation and known boundary conditions, equations for calculating the coefficient vectors {overscore (c_(0,j))}, {overscore (c_(1,j))}, {overscore (c_(2,j))}, and {overscore (c_(3,j))} for the spline segment based on the control points (X_(3j), X_(3j+1), X_(3j+2), X_(3j+3)), and equations for calculating the first and second derivatives for the path starting points and ending points (P_(j)′(0), P_(j)′(1), P_(j)″(0), and P_(j)″(1)), are developed.

The position P_(j) of a cubic Bézier spline segment j can be described by a cubic polynomial P _(j)(u _(j))={overscore (c_(0,j))}+{overscore (c_(1,j))}*u _(j) +{overscore (c _(2,j) )}* u _(j) ² +{overscore (c _(3,j) )}* u _(j) ³ with the coefficient vectors {{overscore (c_(0,j))}, . . . {overscore (c_(3,j))}} and the parameter u_(j)ε[0,1]. However, this representation can be transformed into the standard Bézier representation with the introduction of the control points {X_(3j), . . . , X_(3j+3)} that satisfy the following boundary conditions: 1. The polynomial P_(j)(u_(j)) starts at the control point X_(3j): P_(j)(0)=X_(3j) 2. The polynomial P_(j)(u_(j)) ends at the control point X_(3j+3): P_(j)(1)=X_(3j+3) 3. The polynomial P_(j)(u_(j)) starts with a first derivative defined by the control point X_(3j+1) and the multiplier μ_(s,j): P _(j)′(0)=μ_(s,j)(X _(3j+1) −X _(3j)) 4. The polynomial P_(j)(u_(j)) ends with a first derivative defined by the control point X_(3j+2) and the multiplier μ_(e,j): P _(j)′(1)=μ_(e,j)(X _(3j+3) −X _(3j+2)) 5. The polynomial P_(j)(u_(j)) starts with a second derivative that is independent of the control point X_(3j+3): P _(j)″(0)=f(X _(3j) ,X _(3j+1) ,X _(3j+2)) 6. The polynomial P_(j)(u_(j)) ends with a second derivative that is independent of the control point X_(3j): P _(j)″(1)=g(X _(3j+1) ,X _(3j+2) ,X _(3j+3)) Using the conditions 1, 2, 3, and 4, the polynomial P_(j)(u_(j)), and its first derivative, P _(j)′(u _(j))={overscore (c _(1,j))}+2*{overscore (c _(2,j) )}* u _(j)+3*{overscore (c _(3,j) )}* u _(j) ² a set of equations for the coefficient vectors of the polynomial P_(j)(u_(j)) can be derived as follows. X _(3j) ={overscore (c _(0,j) )} X _(3j+3) ={overscore (c _(0,j) )}+ {overscore (c _(1,j) )}+ {overscore (c _(2,j) )}+ {overscore (c _(3,j) )} μ_(s,j)(X _(3j+1) −X _(3j))={overscore (c _(1,j) )} μ_(e,j)(X _(3j+3) −X _(3j+2))={overscore (c _(1,j) )}2*{overscore (2,j)}+3*{overscore (c _(3,j) )}

In order to solve the above set of equations, the coefficient vector {overscore (c_(3,j))} is separated from the second equation. {overscore (c _(3,j) )}= X _(3j+3) −{overscore (c _(0,j) )}− {overscore (c _(1,j) )}− {overscore (c _(2,j) )} Using the above result, the coefficient vector {overscore (c_(2,j))} can be calculated. $\begin{matrix} {{\mu_{e,j}\left( {X_{{3j} + 3} - X_{{3j} + 2}} \right)} = {\overset{\_}{c_{1,j}} + {2*\overset{\_}{c_{2,j}}} + {3*\overset{\_}{c_{3,j}}}}} \\ {= {\overset{\_}{c_{1,j}} + {2*\overset{\_}{c_{2,j}}} + {3\left( {X_{{3j} + 3} - \overset{\_}{c_{0,j}} - \overset{\_}{c_{1,j}} - \overset{\_}{c_{2,j}}} \right)}}} \\ {= {{{- 3}*\overset{\_}{c_{0,j}}} - {2*\overset{\_}{c_{1,j}}} - c_{2,j} + {3*X_{{3j} + 3}}}} \\ {\overset{\_}{c_{2,j}} = {{{- 3}*\overset{\_}{c_{0,j}}} - {2*\overset{\_}{c_{1,j}}} + {3*X_{{3j} + 3}} -}} \\ {\mu_{e,j}\left( {X_{{3j} + 3} - X_{{3j} + 2}} \right)} \\ {= {{{- 3}*X_{3j}} - {2*\mu_{s,j}\left( {X_{{3j} + 1} - X_{3j}} \right)} +}} \\ {{3*X_{{3j} + 3}} - {\mu_{e,j}\left( {X_{{3j} + 3} - X_{{3j} + 2}} \right)}} \\ {= {{\left( {{2*\mu_{s,j}} - 3} \right)X_{3j}} - {2*\mu_{s,j}*X_{{3j} + 1}} +}} \\ {{\mu_{e,j}*X_{{3j} + 2}} + {\left( {3 - \mu_{e,j}} \right)X_{{3j} + 3}}} \end{matrix}$ Using the coefficient vector {overscore (c_(2,j))}, the coefficient vector {overscore (c_(3,j))} can be calculated. $\begin{matrix} {\overset{\_}{c_{3,j}} = {X_{{3j} + 3} - \overset{\_}{c_{0,j}} - \overset{\_}{c_{1,j}} - \overset{\_}{c_{2,j}}}} \\ {= {X_{{3j} + 3} - X_{3j} - {\mu_{s,j}\left( {X_{{3j} + 1} - X_{3j}} \right)} -}} \\ {{\left( {{2*\mu_{s,j}} - 3} \right)X_{3j}} + {2*\mu_{s,j}*X_{{3j} + 1}} -} \\ {{\mu_{e,j}*X_{{3j} + 2}} - {\left( {3 - \mu_{e,j}} \right)X_{{{3j} + 3}\quad}}} \\ {= {{\left( {2 - \mu_{s,j}} \right)X_{3j}} + {\mu_{s,j}*X_{{3j} + 1}} - {\mu_{e,j}*X_{{3j} + 2}} + {\left( {\mu_{e,j} - 2} \right)X_{{3j} + 3}}}} \end{matrix}$

All the coefficient vectors {{overscore (c_(0,j))}, . . . {overscore (c_(3,j))}} of the polynomial P_(j)(u_(j)) are now represented based on the known control points {X_(3j), . . . , X_(3j+3)} and the unknown multipliers μ_(s,j) and μ_(e,j). Using the conditions 5 and 6 and the second derivative of the polynomial P_(j)(u_(j)) P _(j)″(u _(j))=2*{overscore (c _(2,j) )}+6*{overscore (c _(3,j) )}* u _(j) a set of equations for the multipliers μ_(s,j) and μ_(e,j) can be derived. $\begin{matrix} {{f\left( {X_{3j},X_{{3j} + 1},X_{{3j} + 2}} \right)} = {2*\overset{\_}{c_{2,j}}}} \\ {= {{2\left( {{2*\mu_{s,j}} - 3} \right)X_{3j}} - {4*\mu_{s,j}*X_{{3j} + 1}} +}} \\ {{2*\mu_{e,j}*X_{{3j} + 2}} + {2\left( {3 - \mu_{e,j}} \right)X_{{3j} + 3}}} \\ {{g\left( {X_{{3j} + 1},X_{{3j} + 2},X_{{3j} + 3}} \right)} = {{2*\overset{\_}{c_{2,j}}} + {6*\overset{\_}{c_{3,j}}}}} \\ {= {{2\left( {{2*\mu_{s,j}} - 3} \right)X_{3j}} - {4*\mu_{s,j}*X_{{3j} + 1}} +}} \\ {{2*\mu_{e,j}*X_{{3j} + 2}} + {2\left( {3 - \mu_{e,j}} \right)X_{{3j} + 3}} +} \\ {{6\left( {2 - \mu_{s,j}} \right)X_{3j}} + {6*\mu_{s,j}*X_{{3j} + 1}} -} \\ {{6*\mu_{e.j}*X_{{3j} + 2}} + {6\left( {\mu_{e,j} - 2} \right)X_{{3j} + 3}}} \\ {= {{2\left( {3 - \mu_{s,j}} \right)X_{3j}} + {2*\mu_{s,j}*X_{{3j} + 1}} -}} \\ {{4*\mu_{e,j}*X_{{3j} + 2}} + {2\left( {{2*\mu_{e,j}} - 3} \right)X_{{3j} + 3}}} \end{matrix}$

In order for the function f to be independent of the control point X_(3j+3) and the function g to be independent of the control point X_(3j), the multipliers μ_(s,j) and μ_(e,j) have to be equal to 3. With this result, the coefficient vectors can be simplified: {overscore (c _(0,j) )}= X _(3j) {overscore (c _(1,j) )}=3(−X _(3j) +X _(3j+1)) {overscore (c _(2,j) )}=3(X _(3j)−2*X _(3j+1) +X _(3j+2)) {overscore (c _(3,j) )}=− X _(3j)+3(X _(3j+1) −X _(3j+2))+X _(3j+3)

With the simplified coefficient vectors, the representation of the polynomial P_(j)(u_(j)) can be transformed into the standard Bézier representation: $\begin{matrix} {{P_{j}\left( u_{j} \right)} = {\overset{\_}{c_{0,j}} + {\overset{\_}{c_{1,j}}*u_{j}} + {\overset{\_}{c_{2,j}}*u_{j}^{2}} + {\overset{\_}{c_{3,j}}*u_{j}^{3}}}} \\ {= {X_{3j} + {3\left( {{- X_{3j}} + X_{{3j} + 1}} \right)u_{j}} + {3\left( {X_{3j} - {2*X_{{3j} + 1}} + X_{{3j} + 2}} \right)u_{j}^{2}} +}} \\ {\left( {{- X_{3j}} + {3\left( {X_{{{3j} + 1}\quad} - X_{{3j} + 2}} \right)} + X_{{3j} + 3}} \right)u_{j}^{3}} \\ {= {{X_{3j}\left( {1 - {3*\mu_{j}} + {3*\mu_{j}^{2}} - u_{j}^{3}} \right)} + {3*{X_{{3j} + 1}\left( {u_{j} - {2*u_{j}^{2}} + u_{j}^{3}} \right)}} +}} \\ {{{3*{X_{{3j} + 2}\left( {u_{j}^{2} - u_{j}^{3}} \right)}} + {X_{{3j} + 3}*u_{j}^{3}}}\quad} \\ {= {{X_{3j}\left( {1 - u_{j}} \right)}^{3} + {3*{X_{{3j} + 1}\left( {1 - u_{j}} \right)}^{2}u_{j}} +}} \\ {{3*{X_{{3j} + 2}\left( {1 - u_{j}} \right)}u_{j}^{2}} + {X_{{3j} + 3}*u_{j}^{3}}} \end{matrix}$

With the introduction of the distances {overscore (d _(k) )}:= X _(k) −X _(k−1) {overscore (e _(j) )}:=3*{overscore (d _(3j+2) )} the equations for the coefficient vectors and the first and second derivatives of the polynomial P_(j)(u_(j)) at the transition points can be further simplified: $\begin{matrix} {\overset{\_}{c_{0,j}} = X_{3j}} \\ {\overset{\_}{c_{1,j}} = {3*\overset{\_}{d_{{3j} + 1}}}} \\ {\overset{\_}{c_{2,j}} = {3\left( {\overset{\_}{d_{{3j} + 2}} - \overset{\_}{d_{{3j} + 1}}} \right)}} \\ {= {\overset{\_}{e_{j}} - \overset{\_}{c_{i,j}}}} \\ {\overset{\_}{c_{3,j}} = {X_{{3j} + 3} - X_{3j} - {3*\overset{\_}{d_{{3j} + 2}}}}} \\ {= {X_{{3j} + 3} - X_{3j} - \overset{\_}{e_{j}}}} \\ {{P_{j}^{\prime}(0)} = {3\left( {X_{{3j} + 1} - X_{3j}} \right)}} \\ {= {3*\overset{\_}{d_{{3j} + 1}}}} \\ {{P_{j}^{\prime}(1)} = {3\left( {X_{{3j} + 3} - X_{{3j} + 2}} \right)}} \\ {= {3*\overset{\_}{d_{{3j} + 3}}}} \\ {{P_{j}^{''}(0)} = {f\left( {X_{3j},X_{{3j} + 1},X_{{3j} + 2}} \right)}} \\ {= {6\left( {X_{3j} - {2*X_{{3j} + 1}} + X_{{3j} + 2}} \right)}} \\ {= {6\left( {\overset{\_}{d_{{3j} + 2}} - \overset{\_}{d_{{3j} + 1}}} \right)}} \\ {{P_{j}^{''}(1)} = {g\left( {X_{{3j} + 1},X_{{3j} + 2},X_{{3j} + 3}} \right)}} \\ {= {6\left( {X_{{3j} + 1} - {2*X_{{3j} + 2}} + X_{{3j} + 3}} \right)}} \\ {= {6\left( {\overset{\_}{d_{{3j} + 3}} - \overset{\_}{d_{{3j} + 2}}} \right)}} \end{matrix}$

B. Bézier Spline Interpolation

Based on the knowledge of the equations for the coefficient vector {overscore (c_(0,j))}, {overscore (c_(1,j))}, {overscore (c_(2,j))}, and {overscore (c_(3,j))} and the equations for the first and second derivatives at the path transition points (P_(j)′(0), P_(j)′(1), P_(j)″(0), and P_(j)″(1)) as developed in the previous section for a single path segment, this section derives the general algorithm for Bézier spline interpolation over multiple path segments, including determining the locations of the control points X₁-X_(3m−1) based on the boundary control points X₀ and X_(3m) and the user-specified weighting points {W₀ . . . W_(m)} (where m is the number of Bézier spline segments). Using this information, the equations for the coefficient vectors is also further simplified.

As shown in FIG. 25, a cubic Bézier spline consists of a series of cubic Bézier spline segments with the Bézier spline passing through the control points (X₀, X₃, . . . , X_(3m)} and transitioning at the points {X₃, . . . , X_(3m−3)} with a smooth first and second derivative. As a result, the polynomials P_(j)(u_(j)) with 0≦j<m satisfy the following boundary conditions:

1. The polynomial P_(j)(u_(j)) starts at the control point X_(3j): P _(j)(0)=X _(3j) 0≦j<m 2. The polynomial P_(j)(u_(j)) ends at the control point X_(3j+3): P _(j)(1)=X _(3j+3) 0≦j<m 3. The first derivatives of the preceding polynomial P_(j−1)(u_(j−1)) and the subsequent polynomial P_(j)(u_(j)) are equal at the transition point X_(3j): P _(j−1)′(1)=P _(j)′(0) 0<j<m 4. The second derivatives of the preceding polynomial P_(j−1)(u_(j−1)) and the subsequent polynomial P_(j)(u_(j)) are equal at the transition point X_(3j): P _(j−1)″(1)=P _(j)″(0) 0<j<m

Using the second derivative of the polynomial P_(j)(u_(j)) at the transition points and condition 4, a set of equations for the control points X_(3j−1) with 0<j≦m and X_(3j+1) with 0≦j<m can be derived. P _(j−1)″(1)=P _(j)″(0) 6(X _(3(j−1)+1)−2*X _(3(j−1)+2) +X _(3(j−1)+3))=6(X _(3j)−2*X _(3j+1) +X _(3j+2)) X _(3j−2)−2*X _(3j−1) +X _(3j) =X _(3j)−2*X _(3j+1) +X _(3j+2) 2*X _(3j−1) −X _(3j−2)=2*X _(3j+1) −X _(3j+2) With the specification of the weighting points $\begin{matrix} {W_{j}:={{2*X_{{3j} - 1}} - X_{{3j} - 2}}} & {= {{2*X_{{3j} + 1}} - X_{{3j} + 2}}} \\ {:={X_{{3j} - 1} + \left( {X_{{3j} - 1} - X_{{3j} - 2}} \right)}} & {= {X_{{3j} + 1} - \left( {X_{{3j} + 2} - X_{{3j} + 1}} \right)}} \\ {:={X_{{3j} - 1} + \overset{\_}{d_{{3j} - 1}}}} & {= {X_{{3j} + 1} - \overset{\_}{d_{{3j} + 2}}}} \end{matrix}$ the control points can be derived by the following set of equations. $\begin{matrix} {{W_{j - 1} + {2*W_{j}}} = {\left( {{2*X_{{3{({j - 1})}} + 1}} - X_{{3{({j - 1})}} + 2}} \right) + {2\left( {{2*X_{{3j} - 1}} - X_{{3j} - 2}} \right)}}} \\ {= {{2*X_{{3j} - 2}} - X_{{3j} - 1} + {4*X_{{3j} - 1}} - {2*X_{{3j} - 2}}}} \\ {= {3*X_{{3j} - 1}}} \\ {{{2*W_{j}} + W_{j + 1}} = {{2\left( {{2*X_{{3j} + 1}} - X_{{3j} + 2}} \right)} + \left( {{2*X_{{3{({j + 1})}} - 1}} - X_{{3{({j + 1})}} - 2}} \right)}} \\ {= {{4*X_{{3j} + 1}} - {2*X_{{3j} + 2}} + {2*X_{{3j} + 2}} - X_{{3j} + 1}}} \\ {= {3*X_{{3j} + 1}}} \end{matrix}$

Using the above result, the first derivative of the polynomial P_(j)(u_(j)) at the transition points, and condition 3, a set of equations for the control points X_(3j) with 0<j<m can be derived. P _(j−1)′(1)=P _(j)′(0) 3(X _(3(j−1)+3) −X _(3(j−1)+2))=3(X _(3j+1) −X _(3j)) X _(3j) −X _(3j−1) =X _(3j+1) −X _(3j) 2*X _(3j)=X_(3j−1) +X _(3j+1)

Therefore, the control points X_(k) with 0<k<3m (that is, the control points other than X₀ and X_(3m)) are defined by the following equations. $\begin{matrix} {X_{{3j} - 1} = \frac{W_{j - 1} + {2*W_{j}}}{3}} & {0 < j \leq m} \\ {X_{{3j} + 1} = \frac{{2*W_{j}} + W_{j + 1}}{3}} & {0 \leq j < m} \\ {X_{3j} = \frac{X_{{3j} - 1} + X_{{3j} + 1}}{2}} & {0 < j < m} \end{matrix}$ The remaining control points X₀ and X_(3m) are defined by the boundary conditions.

With these results the equations for the coefficient vectors with 0<j<m can be further simplified. $\begin{matrix} {{\overset{\_}{d}}_{k}:={X_{k} - X_{k - 1}}} \\ {{\overset{\_}{e}}_{j}:={3*{\overset{\_}{d}}_{{3j} + 2}}} \\ {:={3\left( {X_{{3j} + 2} - X_{{3j} + 1}} \right)}} \\ {:={3\left( {X_{{3{({j + 1})}} - 1} - X_{{3j} + 1}} \right)}} \\ {:={3\left( {\frac{W_{{({j + 1})} - 1} + {2*W_{({j + 1})}}}{3} - \frac{{2*W_{j}} + W_{j + 1}}{3}} \right)}} \\ {:={W_{j} + {2*W_{j + 1}} - {2*W_{j}} - W_{j + 1}}} \\ {:={W_{j + 1} - W_{j}}} \\ {\overset{\_}{c_{0,j}} = X_{3j}} \\ {\overset{\_}{c_{1,j}} = {3*\overset{\_}{d_{{3j} + 1}}}} \\ {= {3\left( {X_{{3j} + 1} - X_{3j}} \right)}} \\ {= {3\left( {X_{{3j} + 1} - \frac{X_{{3j} - 1} + X_{{3j} + 1}}{2}} \right)}} \\ {= {\frac{3}{2}\left( {X_{{3j} + 1} - X_{{3j} - 1}} \right)}} \\ {= {\frac{3}{2}\left( {\frac{{2*W_{j}} + W_{j + 1}}{3} - \frac{W_{j - 1} + {2*W_{j}}}{3}} \right)}} \\ {= {\frac{1}{2}\left( {{2*W_{j}} + W_{j + 1} - W_{j - 1} - {2*W_{j}}} \right)}} \\ {= \frac{W_{j + 1} - W_{j - 1}}{2}} \\ {\overset{\_}{c_{2,j}} = {3\left( {\overset{\_}{d_{{3j} + 2}} - \overset{\_}{d_{{3j} + 1}}} \right)}} \\ {= {\overset{\_}{e_{j}} - \overset{\_}{c_{1,j}}}} \\ {\overset{\_}{c_{3,j}} = {X_{{3j} + 3} - X_{3j} - {3*\overset{\_}{d_{{3j} + 2}}}}} \\ {= {X_{{3j} + 3} - X_{3j} - \overset{\_}{e_{j}}}} \end{matrix}$

C. Bézier Spline Transitions

The remaining problem is to smoothly transition to and from a Bézier spline. As previously noted, Bézier spline interpolation may in one embodiment be used to connect linear, circular, and curved path segments. Accordingly, the transition to and from a Bézier spline can occur with or without a specific curvature. The first and last segments of the Bézier spline should have a curvature which matches the curvature (if any) of adjacent linear, circular, or curved path segments. In this section, simplified equations for the control points and the coefficient vectors are developed for the first and last path segments based on expected curvature of adjacent path segments.

1. Transition Without Curvature

With reference to FIG. 27, the transition from a preceding motion profile to a Bézier spline occurs at the control point X₀ with a given tangent {overscore (t_(s))}, a constant first derivative, and a zero curvature. With the second derivative at the transition point P ₀″(0)=6({overscore (d ² )}− {overscore (d ¹ )}) and the requirement of a constant first derivative at the transition point P ₀″(0)={overscore (0)} 6({overscore (d ₂)}−{overscore (d₁)})={overscore (0)} {overscore (d ² )}= {overscore (d _(i) )} the curvature is defined by $\begin{matrix} {\kappa_{s} = \frac{{{P_{0}^{\prime}(0)} \times {P_{0}^{''}(0)}}}{{{P_{0}^{\prime}(0)}}^{3}}} \\ {= \frac{{{P_{0}^{\prime}(0)} \times \overset{\_}{0}}}{{{P_{0}^{\prime}(0)}}^{3}}} \\ {= 0} \end{matrix}$ and the distance {overscore (d₁)} and the control points X₁ and X₂ are defined by the following equations: {overscore (d ₁)}+{overscore (d ² )}+ {overscore (d ² )}= W ₁ −X ₀ 3*{overscore (d ¹ )}= W ₁ −X ₀ $\overset{\_}{d_{1}} = \frac{W_{1} - X_{0}}{3}$  X ₁ =X ₀ +{overscore (d ¹ )} X ₂ =X ₁ +{overscore (d ¹ )}

With these results, the coefficient vectors can be simplified: $\begin{matrix} {\overset{\_}{c_{0,0}} = X_{0}} \\ {\overset{\_}{c_{1,0}} = {3*\overset{\_}{d_{1}}}} \\ {= {W_{1} - X_{0}}} \\ {\overset{\_}{c_{2,0}} = {3\left( {{\overset{\_}{d}}_{2} - {\overset{\_}{d}}_{1}} \right)}} \\ {= \overset{\_}{0}} \\ {\overset{\_}{c_{3,0}} = {X_{3} - X_{0} - {3*\overset{\_}{d_{2}}}}} \\ {= {X_{3} - X_{0} - \left( {W_{1} - X_{0}} \right)}} \\ {= {X_{3} - W_{1}}} \end{matrix}$

The transition from a Bézier spline to a subsequent motion profile can be derived in a similar fashion. $\begin{matrix} {\overset{\_}{d_{{3m} - 1}} = \overset{\_}{d_{3m}}} \\ {\overset{\_}{d_{3m}} = \frac{X_{3m} - W_{m - 1}}{3}} \\ {X_{{3m} - 1} = {X_{3m} - \overset{\_}{d_{3m}}}} \\ {X_{{3m} - 2} = {X_{{3m} - 1} - \overset{\_}{d_{{3m} - 1}}}} \\ {\overset{\_}{e_{m - 1}}:={3*\overset{\_}{d_{{3m} - 1}}}} \\ {:={X_{3m} - W_{m - 1}}} \\ {\overset{\_}{f_{m - 1}}:={X_{{3m} - 3} - W_{m - 1}}} \\ {\overset{\_}{g_{m - 1}}:={3*\overset{\_}{f_{m - 1}}}} \\ {:={3\left( {X_{{3m} - 3} - W_{m - 1}} \right)}} \\ {\overset{\_}{c_{0,{m - 1}}} = X_{{3m} - 3}} \\ {\overset{\_}{c_{1,{m - 1}}} = {3*\overset{\_}{d_{{3m} - 2}}}} \\ {= {3\left( {X_{{3m} - 2} - X_{{3m} - 3}} \right)}} \\ {= {3\left( {W_{m - 1} + \overset{\_}{d_{{3m} - 1}} - X_{{3m} - 3}} \right)}} \\ {= {{3*\overset{\_}{d_{{3m} - 1}}} - {3\left( {X_{{3m} - 3} - W_{m - 1}} \right)}}} \\ {= {\overset{\_}{e_{m - 1}} - \overset{\_}{g_{m - 1}}}} \\ {\overset{\_}{c_{2,{m - 1}}} = {\overset{\_}{e_{m - 1}} - \overset{\_}{c_{1,{m - 1}}}}} \\ {= {\overset{\_}{e_{m - 1}} - \left( {\overset{\_}{e_{m - 1}} - \overset{\_}{g_{m - 1}}} \right)}} \\ {= \overset{\_}{g_{m - 1}}} \\ {\overset{\_}{c_{3,{m - 1}}} = {X_{3m} - X_{{3m} - 3} - \overset{\_}{e_{m - 1}}}} \\ {= {X_{3m} - X_{{3m} - 3} - \left( {X_{3m} - W_{m - 1}} \right)}} \\ {= {W_{m - 1} - X_{{3m} - 3}}} \\ {= {- \overset{\_}{f_{m - 1}}}} \end{matrix}$

2. Transition with Curvature

With reference to FIG. 28, the transition from a preceding motion profile to a Bézier spline occurs at the control point X₀ with a given tangent {overscore (t_(s))} and a given curvature κ_(s). With the first and second derivative at the transition point P ₀′(0)=3*{overscore (d ¹ )} P ₀″(0)=6({overscore (d ² )}− {overscore (d ¹ )}) and the definition of the curvature κ_(s) $\begin{matrix} {\kappa_{s} = \frac{{{P_{0}^{\prime}(0)} \times {P_{0}^{''}(0)}}}{{{P_{0}^{\prime}(0)}}^{3}}} \\ {= \frac{{3*\overset{\_}{d_{1}} \times 6\left( {\overset{\_}{d_{2}} - \overset{\_}{d_{1}}} \right)}}{{{3*\overset{\_}{d_{1}}}}^{3}}} \\ {= \frac{2{{\overset{\_}{d_{1}} \times \left( {\overset{\_}{d_{2}} - \overset{\_}{d_{1}}} \right)}}}{3{\overset{\_}{d_{1}}}^{3}}} \\ {= \frac{2\left( {\overset{\_}{d_{1}} \times \overset{\_}{d_{2}}} \right.}{3{\overset{\_}{d_{1}}}^{3}}} \\ {= \frac{2{{\overset{\_}{d_{1}}{}\overset{\_}{d_{2}}}}{\sin(\psi)}}{3{\overset{\_}{d_{1}}}^{3}}} \\ {= \frac{2{\overset{\_}{d_{2}}}{\sin(\psi)}}{3{\overset{\_}{d_{1}}}^{2}}} \\ {= \frac{n_{1}}{3{\overset{\_}{d_{1}}}^{2}}} \\ {= \frac{{{W_{1} - X_{0}}}{\sin(\varphi)}}{3{\overset{\_}{d_{1}}}^{2}}} \end{matrix}$ the length of the distance {overscore (d₁)} is defined by the following equation. ${\overset{\_}{d_{1}}}^{2} = \frac{{{W_{1} - X_{0}}}{\sin(\varphi)}}{3*\kappa_{s}}$

With reference to FIG. 29, in the case of a transition from a preceding circular motion profile to a Bézier spline with $r = \frac{1}{\kappa_{s}}$ and   ${r\quad{\sin(\varphi)}} = \frac{{W_{1} - X_{0}}}{2}$ the equation for the length of the distance {overscore (d₁)} can be further simplified. $\begin{matrix} {{\overset{\_}{d_{1}}}^{2} = \frac{{{W_{1} - X_{0}}}{\sin(\varphi)}}{3*\kappa_{s}}} \\ {= \frac{{{W_{1} - X_{0}}}r\quad{\sin(\varphi)}}{3}} \\ {= \frac{{{W_{1} - X_{0}}}^{2}}{6}} \end{matrix}$

Therefore, the distances {overscore (d₁)} and {overscore (d₂)} and the control points X₁ and X₂ are defined by the following equations. $\begin{matrix} {\overset{\_}{d_{1}} = {{\overset{\_}{d_{1}}}\frac{\overset{\_}{t_{s}}}{\overset{\_}{t_{s}}}}} \\ {= {\frac{{W_{1} - X_{0}}}{\sqrt{6}}\frac{\overset{\_}{t_{s}}}{\overset{\_}{t_{s}}}}} \\ {X_{1} = {X_{0} + \overset{\_}{d_{1}}}} \\ {\overset{\_}{d_{2}} = \frac{W_{1} - X_{1}}{2}} \\ {X_{2} = {X_{1} + \overset{\_}{d_{2}}}} \end{matrix}$

With these results and {overscore (e ⁰ )}:=3*{overscore (d ² )} the coefficient vectors are defined by: {overscore (c _(0,0))}=X ₀ {overscore (c _(1,0) )}=3*{overscore (d ¹ )} {overscore (c _(2,0) )}= {overscore (e ⁰ )}− {overscore (c _(1,0) )} {overscore (c _(3,0) )} =X ₃ −X ₀ −{overscore (e ⁰ )}

The transition from a Bézier spline to a subsequent motion profile can be derived in a similar fashion. $\begin{matrix} {\overset{\_}{d_{3m}} = {\frac{{X_{3m} - W_{m - 1}}}{\sqrt{6}}\frac{\overset{\_}{t_{e}}}{\overset{\_}{t_{e}}}}} \\ {X_{{3m} - 1} = {X_{3m} - \overset{\_}{d_{3m}}}} \\ {\overset{\_}{d_{{3m} - 1}} = \frac{X_{{3m} - 1} - W_{m - 1}}{2}} \\ {X_{{3m} - 2} = {X_{{3m} - 1} - \overset{\_}{d_{{3m} - 1}}}} \\ {\overset{\_}{e_{m - 1}}:={3*\overset{\_}{d_{{3m} - 1}}}} \\ {\overset{\_}{g_{m - 1}}:={3\left( {X_{{3m} - 3} - W_{m - 1}} \right)}} \\ {\overset{\_}{c_{0,{m - 1}}} = X_{{3m} - 3}} \\ {c_{1,{m - 1}} = {3*\overset{\_}{d_{{3m} - 2}}}} \\ {= {3\left( {X_{{3m} - 2} - X_{{3m} - 3}} \right)}} \\ {= {3\left( {W_{m - 1} + \overset{\_}{d_{{3m} - 1}} - X_{{3m} - 3}} \right)}} \\ {= {{3*\overset{\_}{d_{{3m} - 1}}} - {3\left( {X_{{3m} - 3} - W_{m - 1}} \right)}}} \\ {= {\overset{\_}{e_{m - 1}} - \overset{\_}{g_{m - 1}}}} \\ {\overset{\_}{c_{2,{m - 1}}} = {\overset{\_}{e_{m - 1}} - \overset{\_}{c_{1,{m - 1}}}}} \\ {= {\overset{\_}{e_{m - 1}} - \left( {\overset{\_}{e_{m - 1}} - \overset{\_}{g_{m - 1}}} \right)}} \\ {= \overset{\_}{g_{m - 1}}} \\ {\overset{\_}{c_{3,{m - 1}}} = {X_{3m} - X_{{3m} - 3} - \overset{\_}{e_{m - 1}}}} \end{matrix}$

As previously noted, the Bézier spline interpolation described herein is preferably configured so as to be able to handle dynamic path changes, or changes to the path while a current move is being executed. In the case of a dynamic path change, the transition is referred to herein as a merge transition.

In the case of a merge transition, the details of the preceding motion profile are unknown with the exception of the velocity and acceleration vectors at the transition point. These vectors define the starting velocity {overscore (v_(s))} and starting acceleration {overscore (a_(s))} at the control point X₀. For a transition with curvature, the starting velocity and acceleration are linearly independent and define the bi-normal vector {overscore (b _(s))}={overscore (v _(s) )}× {overscore (a _(s) )} the tangential, bi-normal, and normal unit vectors $\begin{matrix} {{\overset{\_}{i}}_{t} = \frac{\overset{\_}{{\mathcal{v}}_{s}}}{\overset{\_}{{\mathcal{v}}_{s}}}} \\ {{\overset{\_}{i}}_{b} = \frac{\overset{\_}{b_{s}}}{\overset{\_}{b_{s}}}} \\ {{\overset{\_}{i}}_{n} = {{\overset{\_}{i}}_{b} \times {\overset{\_}{i}}_{t}}} \end{matrix}$ and the curvature $\kappa_{s} = {\frac{{\overset{\_}{{\mathcal{v}}_{s}} \times \overset{\_}{a_{s}}}}{{\overset{\_}{{\mathcal{v}}_{s}}}^{3}} = \frac{\overset{\_}{b_{s}}}{{\overset{\_}{{\mathcal{v}}_{s}}}^{3}}}$ With the above results the merge transition can be derived from the circle transition by either defining the chord or arc length.

According to the chord length method, with the chord length equal to the merge tolerance δ ∥W ₁ −X ₀∥=δ and the results from the circle transition, the weighting point W₁ can be calculated. $\begin{matrix} {\overset{\_}{d_{1}} = {\frac{{W_{1} - X_{0}}}{\sqrt{6}}\frac{\overset{\_}{\mathcal{v}}}{\overset{\_}{{\mathcal{v}}_{s}}}}} \\ {= {\frac{\delta}{\sqrt{6}}\overset{\_}{i_{t}}}} \\ {\frac{n_{1}}{3{\overset{\_}{d_{1}}}^{2}} = \kappa_{s}} \\ {n_{1} = {3{\overset{\_}{d_{1}}}^{2}\kappa_{s}}} \\ {= \frac{\delta^{2}*\kappa_{s}}{2}} \end{matrix}$  t ₁ ² +n ₁ ² =∥W ₁ −X ₀∥² t ₁ ²=δ² −n ₁ ² t ₁={square root}{square root over (δ² −n ₁ ²)} W ₁ =X ₀ +t ₁ *{overscore (i _(t) )}+ n ₁ *{overscore (i _(n) )}

With this result the control points X₁ and X₂ are defined by the following equations. $\begin{matrix} {X_{1} = {X_{0} + \overset{\_}{d_{1}}}} \\ {\overset{\_}{d_{2}} = \frac{W_{1} - X_{1}}{2}} \\ {X_{2} = {X_{1} + \overset{\_}{d_{2}}}} \end{matrix}$

According to the arc length method, with the arc length equal to the merge tolerance δ r(2φ) = δ   ${{2(\varphi)} = {\frac{\delta}{r}\quad = {\delta*\kappa_{s}}}}\quad$ and the results from the circle transition, the weighting point W₁ can be calculated. $\begin{matrix} {t_{1} = {r\quad\sin\quad\left( {2\varphi} \right)}} \\ {= {\frac{1}{\kappa_{s}\quad}\sin\quad\left( {\delta*\kappa_{s}}\quad \right)}} \\ {n_{1} = {r\left( {1 - {\cos\left( {2\varphi} \right)}} \right)}} \\ {= {\frac{1}{\kappa_{s}\quad}\left( {1 - {\cos\left( {\delta*\kappa_{s}}\quad \right)}} \right)}} \\ {W_{1} = {X_{0} + {t_{1}*\overset{\_}{i_{t}}} + {n_{1}*\overset{\_}{i_{n}}}}} \end{matrix}$

With this result the control points X₁ and X₂ are defined by the following equations. $\begin{matrix} {{{W_{1} - X_{0}}}^{2} = {t_{1}^{2} + n_{1}^{2}}} \\ {= {{\frac{1}{\kappa_{s}^{2}}{\sin^{2}\left( {\delta*\kappa_{s}} \right)}} + {\frac{1}{\kappa_{s}^{2}}\left( {1 - {\cos\left( {\delta*\kappa_{s}} \right)}} \right)^{2}}}} \\ {= {\frac{1}{\kappa_{s}^{2}}\left( {{\sin^{2}\left( {\delta*\kappa_{s}} \right)} + 1 - {2\quad{\cos\left( {\delta*\kappa_{s}} \right)}} + {\cos^{2}\left( {\delta*\kappa_{s}} \right)}} \right)}} \\ {= {\frac{2}{\kappa_{s}^{2}}\left( {1 - {\cos\left( {\delta*\kappa_{s}} \right)}} \right)}} \\ {= {\frac{4}{\kappa_{s}^{2}}{\sin^{2}\left( \frac{\delta*\kappa_{s}}{2} \right)}}} \\ {{{W_{1} - X_{0}}} = \sqrt{t_{1}^{2} + n_{1}^{2}}} \\ {= {\frac{2}{\kappa_{s}}{\sin\left( \frac{\delta*\kappa_{s}}{2} \right)}}} \\ {\overset{\_}{d_{1}} = {\frac{{W_{1} - X_{0}}}{\sqrt{6}}\frac{\overset{\_}{v_{s}}}{\overset{\_}{v_{s}}}}} \\ {= {\frac{\sqrt{t_{1}^{2} + n_{1}^{2}}}{\sqrt{6}}\overset{\_}{i_{t}}}} \\ {= {\frac{2}{\sqrt{6}\kappa_{s}}{\sin\left( \frac{\delta*\kappa_{s}}{2} \right)}\overset{\_}{i_{t}}}} \end{matrix}$ $\begin{matrix} {X_{1} = {X_{0} + \overset{\_}{d_{1}}}} \\ {\overset{\_}{d_{2}} = \frac{W_{1} - X_{1}}{2}} \\ {X_{2} = {X_{1} + \overset{\_}{d_{2}}}} \end{matrix}\quad$

With the results of either the chord or arc length method and {overscore (e ₀)}:=3*{overscore (d ² )} the coefficient vectors are defined by: {overscore (c _(0,0) )}= X ₀ {overscore (c _(1,0) )}=3*{overscore (d ¹ )} {overscore (c _(2,0) )}= {overscore (e ⁰ )}− {overscore (c _(1,0) )} c _(3,0) =X ₃ −X ₀ −{overscore (e ⁰ )}

Advantageously, this blending technique is independent of the absolute value of the velocity and acceleration at the transition points, only involves the generation of one dynamic profile for the parameters u_(j), and does not require a dynamic coordinate transformation. However, the relationship between the parameter u_(j) and time t needs to be defined and the relationship between the parameter u_(j) and arc length s is non-explicit.

3. Blending Transition

A blending transition is used to blend two motion profiles. Therefore, it is a combination of a transition from the preceding motion profile to a two-segment Bézier spline at the transition point X₀ and from the Bézier spline to the subsequent motion profile at the transition point X₆. Since the two motion profiles are typically defined through an intersection point, which serves as the end point of the preceding profile and as the start point of the subsequent profile, this intersection point is used as weighting point W₁ for the Bézier spline. Based on the equations for transitions with and without curvature, the control points X₁, X₂, X₄, and X₅ can be calculated. The remaining control point is defined by the following equation. $X_{3} = \frac{X_{2} + X_{4}}{2}$

The above calculations can be simplified by applying a coordinate translation with the weighting point W₁ as the new origin to the transition points X₀ and X₆ before calculating the remaining control points. {overscore (X)} _(k) =X _(k) −W ₁

With regard to a line-line transition, an example of a two-segment Bézier spline that blends from one linear motion profile to another linear motion profile with given transition point X₀ and X₆ and intersection point W₁ is shown in FIG. 30. Based on the above results, the control points are given by $\begin{matrix} {\overset{\_}{d_{1}} = \frac{W_{1} - X_{0}}{3}} \\ {X_{1} = {X_{0} + \overset{\_}{d_{1}}}} \\ {X_{2} = {X_{1} + \overset{\_}{d_{1}}}} \\ {\overset{\_}{d_{6}} = \frac{X_{6} - W_{1}}{3}} \\ {X_{5} = {X_{6} - \overset{\_}{d_{6}}}} \\ {X_{4} = {X_{5} - \overset{\_}{d_{6}}}} \\ {X_{3} = \frac{X_{2} + X_{4}}{2}} \end{matrix}$

With regard to a line-circle transition, an example for a two-segment Bézier spline that blends from a linear motion profile to a circular motion profile with given transition point X₀ and X₆ and intersection point W₁ is shown in FIG. 31. Based on the above results, the control points are given by $\begin{matrix} {\overset{\_}{d_{1}} = \frac{W_{1} - X_{0}}{3}} \\ {X_{1} = {X_{0} + \overset{\_}{d_{1}}}} \\ {X_{2} = {X_{1} + \overset{\_}{d_{1}}}} \\ {\overset{\_}{d_{6}} = {\frac{{X_{6} - W_{1}}}{\sqrt{6}}\frac{\overset{\_}{t_{e}}}{\overset{\_}{t_{e}}}}} \\ {X_{5} = {X_{6} - \overset{\_}{d_{6}}}} \\ {\overset{\_}{d_{5}} = \frac{X_{5} - W_{1}}{2}} \\ {X_{4} = {X_{5} - \overset{\_}{d_{5}}}} \\ {X_{3} = \frac{X_{2} + X_{4}}{2}} \end{matrix}$

D. Bézier Spline Dynamics

As indicated initially, the position P_(j) of a cubic Bézier spline segment j is described by a cubic polynomial P _(j)(u _(j))={overscore (c _(0,j) )}+ {overscore (c _(1,j) )}* u _(j) +{overscore (c _(2,j) )}* u _(j) ² +{overscore (c _(3,j) )}* u _(j) ³

-   -   with the coefficient vectors {{overscore (c_(0,j))}, . . .         {overscore (c_(3,j))}} and the parameter u_(j)ε[0,1]. Above, the         equations for the coefficient vectors {{overscore (c_(0,j))}, .         . . {overscore (c_(3,j))}} have been described. However, it is         noted that the position P_(j) of the cubic Bézier spline segment         is a function of u_(j), which is a parameter that is not         inherently time-dependent but rather is defined simply as         varying between zero and one (u_(j)ε[0,1]). Accordingly, the         following two subsections describe two methods for generating         u_(j) as a function of time. This, in turn, allows P_(j) to be         calculated as a function of time.

1. Arc Length Based Dynamics

The arc length based dynamics method uses the knowledge of the arc length s_(j)(u_(j)) as a function of the parameter. With this function the overall arc length l_(k) of a Bézier segment and the overall arc length l of a Bézier spline are defined. l _(k) =s _(j)(1) $l = {\sum\limits_{k = 0}^{m - 1}l_{k}}$

During the initial phase of the profile instruction, the arc length l is used as distance to go and the starting and ending velocity and acceleration v_(s), v_(e), a_(s), and a_(e) are used as boundary conditions in order to generate a motion profile x(t) as a function of time. During the dynamic phase of the profile generation, this motion profile is used to calculate a specific distance x(t_(l)) at a given time. The specific distance x(t_(l)) is then transformed back to a specific arc length s_(j)(x(t_(l))), which in turn is transformed back into a specific parameter u_(j)(s_(j)(x(t_(l)))).

The arc length based dynamics method is advantageous in that it is a simple way of generating constant velocity profiles. However, this approach involves solving the complex relationship between arc length and the parameter u_(j) and the fact that velocity and acceleration may exceed maximum values at sharp corners.

2. Parameter Based Dynamics

The parameter based dynamics method uses the knowledge of the starting and ending velocity and acceleration {overscore (v_(s,j))}, {overscore (v_(e,j))}, {overscore (a_(s,j))}, and {overscore (a_(e,j))} for each Bézier segmentj. These values and the following equations $\begin{matrix} {\overset{\_}{v_{s,j}} = {{\overset{.}{P}}_{j}\left( {u_{j}\left( t_{s} \right)} \right)}} \\ {= {\frac{\mathbb{d}P_{j}}{\mathbb{d}u_{j}}\left( {u_{j}\left( t_{s} \right)} \right)*\frac{\mathbb{d}u_{j}}{\mathbb{d}t}\left( t_{s} \right)}} \\ {= {{P_{j}^{\prime}(0)}*{{\overset{.}{u}}_{j}\left( t_{s} \right)}}} \\ {= {3*\overset{\_}{d_{{3j} + 1}}*{\overset{.}{u}}_{s,j}}} \\ {\overset{\_}{v_{e,j}} = {{\overset{.}{P}}_{j}\left( {u_{j}\left( t_{e} \right)} \right)}} \\ {= {\frac{\mathbb{d}P_{j}}{\mathbb{d}u_{j}}\left( {u_{j}\left( t_{e} \right)} \right)*\frac{\mathbb{d}u_{j}}{\mathbb{d}t}\left( t_{e} \right)}} \\ {= {{P_{j}^{\prime}(1)}*{{\overset{.}{u}}_{j}\left( t_{e} \right)}}} \\ {= {3*\overset{\_}{d_{{3j} + 3}}*{\overset{.}{u}}_{e,j}}} \\ {\overset{\_}{a_{s,j}} = {{\overset{¨}{P}}_{j}\left( {u_{j}\left( t_{s} \right)} \right)}} \\ {= {{\frac{\mathbb{d}^{2}P_{j}}{\mathbb{d}u_{j}^{2}}\left( {u_{j}\left( t_{s} \right)} \right)*\left( {\frac{\mathbb{d}u_{j}}{\mathbb{d}t}\left( t_{s} \right)} \right)^{2}} + {\frac{\mathbb{d}P_{j}}{\mathbb{d}u_{j}}\left( {u_{j}\left( t_{s} \right)} \right)*\frac{\mathbb{d}^{2}u_{j}}{\mathbb{d}t^{2}}\left( t_{s} \right)}}} \\ {= {{{P_{j}^{''}(0)}*{{\overset{.}{u}}_{j}^{2}\left( t_{s} \right)}} + {{P_{j}^{\prime}(0)}*{{\overset{¨}{u}}_{j}\left( t_{s} \right)}}}} \\ {= {{6\left( {\overset{\_}{d_{{3j} + 2}} - \overset{\_}{d_{{3j} + 1}}} \right){\overset{.}{u}}_{s,j}^{2}} + {3*\overset{\_}{d_{{3j} + 1}}*{\overset{¨}{u}}_{s,j}}}} \\ {\overset{\_}{a_{e,j}} = {{\overset{¨}{P}}_{j}\left( {u_{j}\left( t_{e} \right)} \right)}} \\ {= {{\frac{\mathbb{d}^{2}P_{j}}{\mathbb{d}u_{j}^{2}}\left( {u_{j}\left( t_{s} \right)} \right)*\left( {\frac{\mathbb{d}u_{j}}{\mathbb{d}t}\left( t_{e} \right)} \right)^{2}} + {\frac{\mathbb{d}P_{j}}{\mathbb{d}u_{j}}\left( {u_{j}\left( t_{e} \right)} \right)*\frac{\mathbb{d}^{2}u_{j}}{\mathbb{d}t^{2}}\left( t_{e} \right)}}} \\ {= {{{P_{j}^{''}(1)}*{{\overset{.}{u}}_{j}^{2}\left( t_{e} \right)}} + {{P_{j}^{\prime}(1)}*{{\overset{¨}{u}}_{j}\left( t_{e} \right)}}}} \\ {= {{6\left( {\overset{\_}{d_{{3j} + 3}} - \overset{\_}{d_{{3j} + 2}}} \right){\overset{.}{u}}_{e,j}^{2}} + {3*\overset{\_}{d_{{3j} + 3}}*{\overset{¨}{u}}_{e,j}}}} \end{matrix}$ are used to calculate the starting and ending first and second derivatives of the parameter for each Bézier segment j. $\begin{matrix} {{\overset{.}{u}}_{s,j} = \frac{\overset{\_}{v_{s,j}}}{3{\overset{\_}{d_{{3j} + 1}}}}} \\ {{\overset{.}{u}}_{e,j} = \frac{\overset{\_}{v_{e,j}}}{3{\overset{\_}{d_{{3j} + 3}}}}} \\ {{\overset{¨}{u}}_{s,j} = \frac{{\overset{\_}{a_{s,j}} - {6\left( {\overset{\_}{d_{{3j} + 2}} - \overset{\_}{d_{{3j} + 1}}} \right){\overset{.}{u}}_{s,j}^{2}}}}{3{\overset{\_}{d_{{3j} + 1}}}}} \\ {{\overset{¨}{u}}_{e,j} = \frac{{\overset{\_}{a_{e,j}} - {6\left( {\overset{\_}{d_{{3j} + 3}} - \overset{\_}{d_{{3j} + 2}}} \right){\overset{.}{u}}_{e,j}^{2}}}}{3{\overset{\_}{d_{{3j} + 3}}}}} \end{matrix}$

During the initial phase of the profile instruction, the parameter range 1 is used as distance to go and the starting and ending velocity and acceleration {dot over (u)}_(s,j), {dot over (H)}e,j, ü_(s,j), and ü_(e,j) are used as boundary conditions in order to generate a motion profile u_(j)(t) as a function of time. During the dynamic phase of the profile generation, this motion profile is used to calculate a specific parameter u_(j)(t_(l)) at a given time.

The parameter based dynamics method of specifying u_(j) as a function of time is advantageous in that there is no need to solve the complex relationship between the arc length and the parameter u_(j) and the velocity and acceleration is limited to the maximum values at sharp corners. However, generation of constant velocity profiles is more difficult.

The techniques described herein extend to those embodiments which fall within the scope of the appended claims, regardless of whether they provide any of the above mentioned advantageous features. Many changes and modifications may also be made to the invention without departing from the spirit thereof. The scope of these changes will become apparent from the appended claims. 

1. A system comprising control logic and a programming interface, the programming interface being configured to permit a user to specify a plurality of weighting points in a multi-dimensional coordinate space, and the control logic including spline computation logic configured to generate a spline curve based on boundary conditions, wherein the spline curve extends near the weighting points, and wherein the control logic is configured to generate control signals to control operation of a plurality of motion axes to drive movement of a controlled element along a path defined by the spline curve.
 2. A system according to claim 1, wherein the spline curve is a Bézier spline curve.
 3. A system according to claim 1, wherein the spline curve does not pass through the weighting points.
 4. A system according to claim 1, wherein the spline curve comprises a plurality of spline curve segments; wherein the control logic determines a starting velocity vector, a starting acceleration vector, an ending velocity vector, and an ending acceleration vector for each of the spline curve segments; wherein the ending velocity vector and the ending acceleration vector for each of the plurality of spline curve segments are determined so as to be approximately equal to the starting velocity vector and the starting acceleration vector for a next adjacent one of the plurality of spline curve segments.
 5. A system according to claim 1, wherein the control signals include position reference values, and wherein the control logic includes an interpolator configured to generate the position reference values substantially simultaneously along a plurality of different motion axes.
 6. A system according to claim 5, wherein the interpolator generates the position reference values based on a plurality of coefficient vectors, the coefficient vectors being coefficients of the spline curve and being determined based on the boundary conditions and the weighting points.
 7. A system according to claim 1, wherein the path defined by the spline curve connects first and second additional path segments, the first and second additional path segments being non-tangential.
 8. A system according to claim 7, wherein the first and second additional path segments are linear path segments.
 9. A system according to claim 7, wherein one of the first and second additional path segments is a linear path segment and the other one of the first and second additional path segments is a curved path segment.
 10. A system according to claim 7, wherein the first and second additional path segments are curved path segments.
 11. A system according to claim 7, wherein the merging point is derived from the first and second path segment.
 12. A system according to claim 7, wherein the spline curve is generated without using characteristics of the first and second path segments other than velocity and acceleration vectors for the first and second path segments at the boundary points.
 13. A system according to claim 1, wherein the programming interface is an object-oriented programming interface in which displayable objects are used to represent physical hardware and relationships between physical hardware.
 14. A system according to claim 1, wherein the programming interface includes a jog block which permits the user via a jog instruction to specify a new motion axis velocity, a move block which permits the user via a move instruction to specify a new motion axis position, a time cam block which permits a user via a time cam instruction to specify a motion axis position profile which specifies motion axis position as a function of time, a gear block which permits the user via a gear instruction to specify an electronic gearing relationship between the position of one motion axis and the position of another motion axis, a position cam block which permits the user via a position cam instruction to specify a motion axis position profile which specifies the position of one axis as a function of the position of another motion axis.
 15. A system according to claim 1, wherein the system is an industrial control system.
 16. A control method for controlling movement of a controlled element in a multi-dimensional coordinate system, comprising: receiving a plurality of weighting points by way of a user instruction; generating a plurality of control points for a plurality of adjacent spline segments based on boundary conditions and the plurality of weighting points; generating a plurality of coefficient vectors for the plurality of spline segments based on the plurality of control points; generating a first plurality of position reference values based on the plurality of coefficient vectors and using the first plurality of position reference values to control a first motion axis, the first motion axis operating in a first dimension of the multi-dimensional coordinate system; and generating a second plurality of position reference values based on the plurality of coefficient vectors and using the second plurality of position reference values to control a second motion axis, the second motion axis operating in a second dimension of the multi-dimensional coordinate system.
 17. A method according to claim 16, wherein, during movement along the transition path segment, the controlled element transitions from a previous path segment, to the spline path, and then to a next path segment without discontinuities in velocity and acceleration.
 18. A method according to claim 16, wherein the plurality of adjacent spline segments form a Bézier spline curve.
 19. A method according to claim 16, wherein the plurality of spline segments do not pass through the weighting points.
 20. A method according to claim 16, wherein each of the plurality of spline curve segments have a starting velocity vector, a starting acceleration vector, an ending velocity vector, and an ending acceleration vector; wherein the method further comprises determining the ending velocity vector and the ending acceleration vector for each of the plurality of spline curve segments are determined so as to be approximately equal to the starting velocity vector and the starting acceleration vector for a next adjacent one of the plurality of spline curve segments.
 21. A method according to claim 16, wherein the user instruction is provided as part of a programming interface, and wherein the programming interface is an object-oriented programming interface in which displayable objects are used to represent physical hardware and relationships between physical hardware.
 22. A method according to claim 16, wherein the user instruction is provided as part of a programming interface, and wherein the programming interface includes a jog block which permits the user via a jog instruction to specify a new motion axis velocity, a move block which permits the user via a move instruction to specify a new motion axis position, a time cam block which permits a user via a time cam instruction to specify a motion axis position profile which specifies motion axis position as a function of time, a gear block which permits the user via a gear instruction to specify an electronic gearing relationship between the position of one motion axis and the position of another motion axis, a position cam block which permits the user via a position cam instruction to specify a motion axis position profile which specifies the position of one motion axis as a function of the position of another motion axis.
 23. A system for controlling a first motion axis and a second motion axis; the system comprising motion control logic configured to control the first motion axis and the second motion axis in accordance with a user program, wherein the motion control logic provides a plurality of instructions configured for use in the user program, the plurality of instructions including an instruction that permits a move to be specified by specifying weighting points for a spline path to be followed by the controlled element in a multi-dimensional coordinate system that includes the first motion axis and the second motion axis.
 24. An industrial control system comprising: a plurality of input devices; a plurality of output devices; a communication network; a plurality of motion axes; a plurality of microprocessor-based controllers, the plurality of controllers being coupled to each other by way of the communication network, the plurality of controllers being coupled to respective ones of the plurality of input devices and the plurality of output devices, the plurality of controllers being configured to control the plurality of output devices based on input status information from the plurality of input devices, the plurality of microprocessor-based controllers including control logic configured to control the plurality of motion axes, and the plurality of controllers being configured to be programmed with a user program; and a programming interface, the programming interface being configured to permit a user to generate the user program, the user program including a user instruction which permits the user to specify a plurality of weighting points in a multi-dimensional coordinate space; and wherein the control logic includes spline computation logic configured to generate a spline curve which extends near the weighting points, and is configured to generate control signals to control operation of the plurality of motion axes to drive movement of a controlled element along a path defined by the spline curve. 